./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:16,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:16,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:16,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:16,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:16,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:16,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:16,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:16,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:16,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:16,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:16,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:16,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:16,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:16,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:16,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:16,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:16,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:16,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:16,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:16,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:16,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:16,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:16,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:16,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:16,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:16,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:16,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:16,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:16,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:16,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:16,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:16,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:16,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:16,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:16,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:16,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:16,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:16,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:16,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:16,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:16,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:16,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:16,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:16,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:16,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:16,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:16,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:16,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:16,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:16,310 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:16,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:16,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:16,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:16,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:16,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:16,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:16,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:16,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:16,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:16,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:16,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:16,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:16,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:16,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:16,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:16,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:16,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:16,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:16,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba [2022-02-20 19:59:16,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:16,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:16,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:16,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:16,528 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:16,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:16,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0500531e6/680ab69c955c446f8a0294272509960b/FLAG96d920c86 [2022-02-20 19:59:16,964 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:16,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:16,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0500531e6/680ab69c955c446f8a0294272509960b/FLAG96d920c86 [2022-02-20 19:59:16,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0500531e6/680ab69c955c446f8a0294272509960b [2022-02-20 19:59:16,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:16,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:16,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:16,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:16,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:16,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:16,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112a85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16, skipping insertion in model container [2022-02-20 19:59:16,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:16,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:17,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:17,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2022-02-20 19:59:17,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2022-02-20 19:59:17,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,294 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:17,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2022-02-20 19:59:17,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2022-02-20 19:59:17,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,400 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:17,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17 WrapperNode [2022-02-20 19:59:17,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:17,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:17,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,497 INFO L137 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1041 [2022-02-20 19:59:17,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:17,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:17,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:17,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:17,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:17,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:17,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:17,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:17,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:17,641 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:17,737 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:17,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:18,378 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:18,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:18,388 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 19:59:18,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18 BoogieIcfgContainer [2022-02-20 19:59:18,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:18,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:18,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:18,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:18,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:16" (1/3) ... [2022-02-20 19:59:18,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f672083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (2/3) ... [2022-02-20 19:59:18,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f672083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18" (3/3) ... [2022-02-20 19:59:18,395 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:18,401 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:18,401 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:18,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:18,438 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:18,438 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 19:59:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:18,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:18,471 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash -322783681, now seen corresponding path program 1 times [2022-02-20 19:59:18,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:18,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593567803] [2022-02-20 19:59:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {489#(= ~q_read_ev~0 2)} #1885#return; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#(= |old(~q_read_ev~0)| 0)} assume true; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#(= |old(~q_read_ev~0)| 0)} {489#(= ~q_read_ev~0 2)} #1887#return; {488#false} is VALID [2022-02-20 19:59:18,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} havoc ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume !(1 == ~p_dw_pc~0); {487#true} is VALID [2022-02-20 19:59:18,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} ~__retres1~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#true} #res := ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,845 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {487#true} {487#true} #1881#return; {487#true} is VALID [2022-02-20 19:59:18,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} havoc ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume 1 == ~c_dr_pc~0; {487#true} is VALID [2022-02-20 19:59:18,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {487#true} is VALID [2022-02-20 19:59:18,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#true} #res := ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,853 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {487#true} {487#true} #1883#return; {487#true} is VALID [2022-02-20 19:59:18,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {487#true} is VALID [2022-02-20 19:59:18,854 INFO L272 TraceCheckUtils]: 1: Hoare triple {487#true} call #t~ret8 := is_do_write_p_triggered(); {487#true} is VALID [2022-02-20 19:59:18,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} havoc ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#true} assume !(1 == ~p_dw_pc~0); {487#true} is VALID [2022-02-20 19:59:18,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#true} ~__retres1~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} #res := ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,856 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {487#true} {487#true} #1881#return; {487#true} is VALID [2022-02-20 19:59:18,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {487#true} is VALID [2022-02-20 19:59:18,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {487#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,857 INFO L272 TraceCheckUtils]: 10: Hoare triple {487#true} call #t~ret9 := is_do_read_c_triggered(); {487#true} is VALID [2022-02-20 19:59:18,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#true} havoc ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#true} assume 1 == ~c_dr_pc~0; {487#true} is VALID [2022-02-20 19:59:18,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {487#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {487#true} is VALID [2022-02-20 19:59:18,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#true} #res := ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,859 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {487#true} {487#true} #1883#return; {487#true} is VALID [2022-02-20 19:59:18,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {487#true} is VALID [2022-02-20 19:59:18,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {487#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,860 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {487#true} {488#false} #1889#return; {488#false} is VALID [2022-02-20 19:59:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {487#true} is VALID [2022-02-20 19:59:18,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {487#true} is VALID [2022-02-20 19:59:18,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {488#false} #1891#return; {488#false} is VALID [2022-02-20 19:59:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} havoc ~__retres1~2; {487#true} is VALID [2022-02-20 19:59:18,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {487#true} is VALID [2022-02-20 19:59:18,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} #res := ~__retres1~2; {487#true} is VALID [2022-02-20 19:59:18,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,886 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {487#true} {488#false} #1893#return; {488#false} is VALID [2022-02-20 19:59:18,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {487#true} is VALID [2022-02-20 19:59:18,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(= ~q_read_ev~0 2)} call update_channels1(); {527#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:18,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,895 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {528#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {489#(= ~q_read_ev~0 2)} #1885#return; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {489#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {489#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {489#(= ~q_read_ev~0 2)} call fire_delta_events1(); {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(= |old(~q_read_ev~0)| 0)} assume true; {530#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,900 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {530#(= |old(~q_read_ev~0)| 0)} {489#(= ~q_read_ev~0 2)} #1887#return; {488#false} is VALID [2022-02-20 19:59:18,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {488#false} call activate_threads1(); {531#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:18,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {531#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {487#true} is VALID [2022-02-20 19:59:18,901 INFO L272 TraceCheckUtils]: 19: Hoare triple {487#true} call #t~ret8 := is_do_write_p_triggered(); {487#true} is VALID [2022-02-20 19:59:18,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {487#true} havoc ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {487#true} assume !(1 == ~p_dw_pc~0); {487#true} is VALID [2022-02-20 19:59:18,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {487#true} ~__retres1~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#true} #res := ~__retres1~0; {487#true} is VALID [2022-02-20 19:59:18,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,902 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {487#true} {487#true} #1881#return; {487#true} is VALID [2022-02-20 19:59:18,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {487#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {487#true} is VALID [2022-02-20 19:59:18,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {487#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {487#true} call #t~ret9 := is_do_read_c_triggered(); {487#true} is VALID [2022-02-20 19:59:18,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {487#true} havoc ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {487#true} assume 1 == ~c_dr_pc~0; {487#true} is VALID [2022-02-20 19:59:18,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {487#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {487#true} is VALID [2022-02-20 19:59:18,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {487#true} #res := ~__retres1~1; {487#true} is VALID [2022-02-20 19:59:18,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,903 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {487#true} {487#true} #1883#return; {487#true} is VALID [2022-02-20 19:59:18,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {487#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {487#true} is VALID [2022-02-20 19:59:18,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {487#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {487#true} is VALID [2022-02-20 19:59:18,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,904 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {487#true} {488#false} #1889#return; {488#false} is VALID [2022-02-20 19:59:18,904 INFO L272 TraceCheckUtils]: 39: Hoare triple {488#false} call reset_delta_events1(); {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {529#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {487#true} is VALID [2022-02-20 19:59:18,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {487#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {487#true} is VALID [2022-02-20 19:59:18,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,905 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {487#true} {488#false} #1891#return; {488#false} is VALID [2022-02-20 19:59:18,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:18,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {488#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {488#false} is VALID [2022-02-20 19:59:18,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:18,906 INFO L272 TraceCheckUtils]: 47: Hoare triple {488#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {487#true} is VALID [2022-02-20 19:59:18,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {487#true} havoc ~__retres1~2; {487#true} is VALID [2022-02-20 19:59:18,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {487#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {487#true} is VALID [2022-02-20 19:59:18,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {487#true} #res := ~__retres1~2; {487#true} is VALID [2022-02-20 19:59:18,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {487#true} assume true; {487#true} is VALID [2022-02-20 19:59:18,909 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {487#true} {488#false} #1893#return; {488#false} is VALID [2022-02-20 19:59:18,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {488#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {488#false} is VALID [2022-02-20 19:59:18,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {488#false} assume 0 != eval1_~tmp___1~0#1; {488#false} is VALID [2022-02-20 19:59:18,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {488#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {488#false} is VALID [2022-02-20 19:59:18,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {488#false} assume !(0 != eval1_~tmp~2#1); {488#false} is VALID [2022-02-20 19:59:18,910 INFO L272 TraceCheckUtils]: 57: Hoare triple {488#false} call error1(); {488#false} is VALID [2022-02-20 19:59:18,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:18,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593567803] [2022-02-20 19:59:18,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593567803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:18,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712091410] [2022-02-20 19:59:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:18,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:18,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:18,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:18,999 INFO L87 Difference]: Start difference. First operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,322 INFO L93 Difference]: Finished difference Result 1076 states and 1722 transitions. [2022-02-20 19:59:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1722 transitions. [2022-02-20 19:59:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1722 transitions. [2022-02-20 19:59:22,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1722 transitions. [2022-02-20 19:59:23,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,453 INFO L225 Difference]: With dead ends: 1076 [2022-02-20 19:59:23,453 INFO L226 Difference]: Without dead ends: 610 [2022-02-20 19:59:23,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:23,460 INFO L933 BasicCegarLoop]: 754 mSDtfsCounter, 1210 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:23,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1215 Valid, 2513 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-02-20 19:59:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 570. [2022-02-20 19:59:23,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:23,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:23,510 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:23,512 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:23,544 INFO L93 Difference]: Finished difference Result 610 states and 915 transitions. [2022-02-20 19:59:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 915 transitions. [2022-02-20 19:59:23,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:23,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:23,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 610 states. [2022-02-20 19:59:23,551 INFO L87 Difference]: Start difference. First operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 610 states. [2022-02-20 19:59:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:23,582 INFO L93 Difference]: Finished difference Result 610 states and 915 transitions. [2022-02-20 19:59:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 915 transitions. [2022-02-20 19:59:23,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:23,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:23,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:23,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 860 transitions. [2022-02-20 19:59:23,617 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 860 transitions. Word has length 59 [2022-02-20 19:59:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:23,617 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 860 transitions. [2022-02-20 19:59:23,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-02-20 19:59:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:23,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:23,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:23,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:23,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1605489021, now seen corresponding path program 1 times [2022-02-20 19:59:23,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:23,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481416232] [2022-02-20 19:59:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {3993#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3955#(= ~q_write_ev~0 ~q_read_ev~0)} #1885#return; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3995#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {3995#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3955#(= ~q_write_ev~0 ~q_read_ev~0)} #1887#return; {3954#false} is VALID [2022-02-20 19:59:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {3953#true} havoc ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume !(1 == ~p_dw_pc~0); {3953#true} is VALID [2022-02-20 19:59:23,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} ~__retres1~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {3953#true} #res := ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,719 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3953#true} {3953#true} #1881#return; {3953#true} is VALID [2022-02-20 19:59:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {3953#true} havoc ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume 1 == ~c_dr_pc~0; {3953#true} is VALID [2022-02-20 19:59:23,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {3953#true} #res := ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3953#true} {3953#true} #1883#return; {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {3997#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L272 TraceCheckUtils]: 1: Hoare triple {3953#true} call #t~ret8 := is_do_write_p_triggered(); {3953#true} is VALID [2022-02-20 19:59:23,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} havoc ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {3953#true} assume !(1 == ~p_dw_pc~0); {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {3953#true} ~__retres1~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {3953#true} #res := ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3953#true} {3953#true} #1881#return; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {3953#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3953#true} is VALID [2022-02-20 19:59:23,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {3953#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L272 TraceCheckUtils]: 10: Hoare triple {3953#true} call #t~ret9 := is_do_read_c_triggered(); {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {3953#true} havoc ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {3953#true} assume 1 == ~c_dr_pc~0; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {3953#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {3953#true} #res := ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,727 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3953#true} {3953#true} #1883#return; {3953#true} is VALID [2022-02-20 19:59:23,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {3953#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3953#true} is VALID [2022-02-20 19:59:23,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {3953#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,728 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3953#true} {3954#false} #1889#return; {3954#false} is VALID [2022-02-20 19:59:23,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3953#true} is VALID [2022-02-20 19:59:23,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3953#true} is VALID [2022-02-20 19:59:23,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3953#true} {3954#false} #1891#return; {3954#false} is VALID [2022-02-20 19:59:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {3953#true} havoc ~__retres1~2; {3953#true} is VALID [2022-02-20 19:59:23,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3953#true} is VALID [2022-02-20 19:59:23,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} #res := ~__retres1~2; {3953#true} is VALID [2022-02-20 19:59:23,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,737 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3953#true} {3954#false} #1893#return; {3954#false} is VALID [2022-02-20 19:59:23,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {3953#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {3953#true} is VALID [2022-02-20 19:59:23,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3993#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:23,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {3993#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,740 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3955#(= ~q_write_ev~0 ~q_read_ev~0)} #1885#return; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3955#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:23,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {3955#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3995#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {3995#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:23,743 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3996#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3955#(= ~q_write_ev~0 ~q_read_ev~0)} #1887#return; {3954#false} is VALID [2022-02-20 19:59:23,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {3954#false} call activate_threads1(); {3997#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:23,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {3997#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3953#true} is VALID [2022-02-20 19:59:23,744 INFO L272 TraceCheckUtils]: 19: Hoare triple {3953#true} call #t~ret8 := is_do_write_p_triggered(); {3953#true} is VALID [2022-02-20 19:59:23,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {3953#true} havoc ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {3953#true} assume !(1 == ~p_dw_pc~0); {3953#true} is VALID [2022-02-20 19:59:23,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {3953#true} ~__retres1~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {3953#true} #res := ~__retres1~0; {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3953#true} {3953#true} #1881#return; {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {3953#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {3953#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {3953#true} call #t~ret9 := is_do_read_c_triggered(); {3953#true} is VALID [2022-02-20 19:59:23,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {3953#true} havoc ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {3953#true} assume 1 == ~c_dr_pc~0; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {3953#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {3953#true} #res := ~__retres1~1; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3953#true} {3953#true} #1883#return; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {3953#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3953#true} is VALID [2022-02-20 19:59:23,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {3953#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3953#true} is VALID [2022-02-20 19:59:23,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,758 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3953#true} {3954#false} #1889#return; {3954#false} is VALID [2022-02-20 19:59:23,758 INFO L272 TraceCheckUtils]: 39: Hoare triple {3954#false} call reset_delta_events1(); {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:23,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {3994#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3953#true} is VALID [2022-02-20 19:59:23,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {3953#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3953#true} is VALID [2022-02-20 19:59:23,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,758 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3953#true} {3954#false} #1891#return; {3954#false} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {3954#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {3954#false} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 19:59:23,759 INFO L272 TraceCheckUtils]: 47: Hoare triple {3954#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3953#true} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {3953#true} havoc ~__retres1~2; {3953#true} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {3953#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3953#true} is VALID [2022-02-20 19:59:23,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {3953#true} #res := ~__retres1~2; {3953#true} is VALID [2022-02-20 19:59:23,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {3953#true} assume true; {3953#true} is VALID [2022-02-20 19:59:23,760 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3953#true} {3954#false} #1893#return; {3954#false} is VALID [2022-02-20 19:59:23,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {3954#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3954#false} is VALID [2022-02-20 19:59:23,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {3954#false} assume 0 != eval1_~tmp___1~0#1; {3954#false} is VALID [2022-02-20 19:59:23,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {3954#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3954#false} is VALID [2022-02-20 19:59:23,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {3954#false} assume !(0 != eval1_~tmp~2#1); {3954#false} is VALID [2022-02-20 19:59:23,761 INFO L272 TraceCheckUtils]: 57: Hoare triple {3954#false} call error1(); {3954#false} is VALID [2022-02-20 19:59:23,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 19:59:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:23,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:23,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481416232] [2022-02-20 19:59:23,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481416232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:23,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:23,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:23,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360983195] [2022-02-20 19:59:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:23,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:23,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:23,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:23,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:23,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:23,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:23,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:23,797 INFO L87 Difference]: Start difference. First operand 570 states and 860 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,311 INFO L93 Difference]: Finished difference Result 919 states and 1339 transitions. [2022-02-20 19:59:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1068 transitions. [2022-02-20 19:59:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1068 transitions. [2022-02-20 19:59:27,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1068 transitions. [2022-02-20 19:59:28,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1068 edges. 1068 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:28,142 INFO L225 Difference]: With dead ends: 919 [2022-02-20 19:59:28,142 INFO L226 Difference]: Without dead ends: 741 [2022-02-20 19:59:28,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:28,144 INFO L933 BasicCegarLoop]: 776 mSDtfsCounter, 1433 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:28,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1464 Valid, 2689 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-02-20 19:59:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 666. [2022-02-20 19:59:28,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:28,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 741 states. Second operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:59:28,167 INFO L74 IsIncluded]: Start isIncluded. First operand 741 states. Second operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:59:28,168 INFO L87 Difference]: Start difference. First operand 741 states. Second operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:59:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:28,211 INFO L93 Difference]: Finished difference Result 741 states and 1098 transitions. [2022-02-20 19:59:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1098 transitions. [2022-02-20 19:59:28,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:28,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:28,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 741 states. [2022-02-20 19:59:28,216 INFO L87 Difference]: Start difference. First operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 741 states. [2022-02-20 19:59:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:28,242 INFO L93 Difference]: Finished difference Result 741 states and 1098 transitions. [2022-02-20 19:59:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1098 transitions. [2022-02-20 19:59:28,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:28,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:28,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:28,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:59:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 994 transitions. [2022-02-20 19:59:28,271 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 994 transitions. Word has length 59 [2022-02-20 19:59:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:28,271 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 994 transitions. [2022-02-20 19:59:28,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 994 transitions. [2022-02-20 19:59:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:28,272 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:28,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:28,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:28,273 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1795991937, now seen corresponding path program 1 times [2022-02-20 19:59:28,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:28,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807673056] [2022-02-20 19:59:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {7661#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7622#true} is VALID [2022-02-20 19:59:28,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7622#true} {7622#true} #1885#return; {7622#true} is VALID [2022-02-20 19:59:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume !(0 == ~q_write_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7622#true} {7622#true} #1887#return; {7622#true} is VALID [2022-02-20 19:59:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {7622#true} havoc ~__retres1~0; {7622#true} is VALID [2022-02-20 19:59:28,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume !(1 == ~p_dw_pc~0); {7622#true} is VALID [2022-02-20 19:59:28,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} ~__retres1~0 := 0; {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:28,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,442 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7622#true} #1881#return; {7670#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {7622#true} havoc ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume 1 == ~c_dr_pc~0; {7622#true} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7622#true} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {7622#true} #res := ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,448 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7622#true} {7623#false} #1883#return; {7623#false} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {7663#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7622#true} is VALID [2022-02-20 19:59:28,449 INFO L272 TraceCheckUtils]: 1: Hoare triple {7622#true} call #t~ret8 := is_do_write_p_triggered(); {7622#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} havoc ~__retres1~0; {7622#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {7622#true} assume !(1 == ~p_dw_pc~0); {7622#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {7622#true} ~__retres1~0 := 0; {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,455 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7622#true} #1881#return; {7670#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:28,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {7670#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7671#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:28,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {7671#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7623#false} is VALID [2022-02-20 19:59:28,457 INFO L272 TraceCheckUtils]: 10: Hoare triple {7623#false} call #t~ret9 := is_do_read_c_triggered(); {7622#true} is VALID [2022-02-20 19:59:28,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {7622#true} havoc ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {7622#true} assume 1 == ~c_dr_pc~0; {7622#true} is VALID [2022-02-20 19:59:28,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {7622#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7622#true} is VALID [2022-02-20 19:59:28,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {7622#true} #res := ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,459 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7622#true} {7623#false} #1883#return; {7623#false} is VALID [2022-02-20 19:59:28,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {7623#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7623#false} is VALID [2022-02-20 19:59:28,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {7623#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7623#false} is VALID [2022-02-20 19:59:28,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {7623#false} assume true; {7623#false} is VALID [2022-02-20 19:59:28,461 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7623#false} {7622#true} #1889#return; {7623#false} is VALID [2022-02-20 19:59:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7622#true} is VALID [2022-02-20 19:59:28,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7622#true} {7623#false} #1891#return; {7623#false} is VALID [2022-02-20 19:59:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {7622#true} havoc ~__retres1~2; {7622#true} is VALID [2022-02-20 19:59:28,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7622#true} is VALID [2022-02-20 19:59:28,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} #res := ~__retres1~2; {7622#true} is VALID [2022-02-20 19:59:28,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,475 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7622#true} {7623#false} #1893#return; {7623#false} is VALID [2022-02-20 19:59:28,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {7622#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {7622#true} is VALID [2022-02-20 19:59:28,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {7622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {7622#true} is VALID [2022-02-20 19:59:28,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {7622#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {7622#true} is VALID [2022-02-20 19:59:28,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {7622#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7622#true} is VALID [2022-02-20 19:59:28,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {7622#true} call update_channels1(); {7661#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:28,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {7661#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7622#true} is VALID [2022-02-20 19:59:28,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,477 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7622#true} {7622#true} #1885#return; {7622#true} is VALID [2022-02-20 19:59:28,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {7622#true} assume { :begin_inline_init_threads1 } true; {7622#true} is VALID [2022-02-20 19:59:28,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {7622#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7622#true} is VALID [2022-02-20 19:59:28,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {7622#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7622#true} is VALID [2022-02-20 19:59:28,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {7622#true} assume { :end_inline_init_threads1 } true; {7622#true} is VALID [2022-02-20 19:59:28,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {7622#true} call fire_delta_events1(); {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:28,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {7622#true} assume !(0 == ~q_write_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,479 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7622#true} {7622#true} #1887#return; {7622#true} is VALID [2022-02-20 19:59:28,480 INFO L272 TraceCheckUtils]: 17: Hoare triple {7622#true} call activate_threads1(); {7663#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:28,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {7663#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7622#true} is VALID [2022-02-20 19:59:28,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {7622#true} call #t~ret8 := is_do_write_p_triggered(); {7622#true} is VALID [2022-02-20 19:59:28,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {7622#true} havoc ~__retres1~0; {7622#true} is VALID [2022-02-20 19:59:28,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {7622#true} assume !(1 == ~p_dw_pc~0); {7622#true} is VALID [2022-02-20 19:59:28,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {7622#true} ~__retres1~0 := 0; {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:28,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {7678#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:28,482 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7679#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7622#true} #1881#return; {7670#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:28,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {7670#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7671#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:28,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {7671#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7623#false} is VALID [2022-02-20 19:59:28,483 INFO L272 TraceCheckUtils]: 28: Hoare triple {7623#false} call #t~ret9 := is_do_read_c_triggered(); {7622#true} is VALID [2022-02-20 19:59:28,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {7622#true} havoc ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {7622#true} assume 1 == ~c_dr_pc~0; {7622#true} is VALID [2022-02-20 19:59:28,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {7622#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7622#true} is VALID [2022-02-20 19:59:28,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {7622#true} #res := ~__retres1~1; {7622#true} is VALID [2022-02-20 19:59:28,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,484 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7622#true} {7623#false} #1883#return; {7623#false} is VALID [2022-02-20 19:59:28,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {7623#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7623#false} is VALID [2022-02-20 19:59:28,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {7623#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7623#false} is VALID [2022-02-20 19:59:28,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {7623#false} assume true; {7623#false} is VALID [2022-02-20 19:59:28,484 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7623#false} {7622#true} #1889#return; {7623#false} is VALID [2022-02-20 19:59:28,485 INFO L272 TraceCheckUtils]: 39: Hoare triple {7623#false} call reset_delta_events1(); {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:28,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {7662#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7622#true} is VALID [2022-02-20 19:59:28,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {7622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7622#true} is VALID [2022-02-20 19:59:28,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,486 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7622#true} {7623#false} #1891#return; {7623#false} is VALID [2022-02-20 19:59:28,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {7623#false} assume !false; {7623#false} is VALID [2022-02-20 19:59:28,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {7623#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {7623#false} is VALID [2022-02-20 19:59:28,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {7623#false} assume !false; {7623#false} is VALID [2022-02-20 19:59:28,487 INFO L272 TraceCheckUtils]: 47: Hoare triple {7623#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7622#true} is VALID [2022-02-20 19:59:28,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {7622#true} havoc ~__retres1~2; {7622#true} is VALID [2022-02-20 19:59:28,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {7622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7622#true} is VALID [2022-02-20 19:59:28,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {7622#true} #res := ~__retres1~2; {7622#true} is VALID [2022-02-20 19:59:28,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {7622#true} assume true; {7622#true} is VALID [2022-02-20 19:59:28,487 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7622#true} {7623#false} #1893#return; {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {7623#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {7623#false} assume 0 != eval1_~tmp___1~0#1; {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {7623#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {7623#false} assume !(0 != eval1_~tmp~2#1); {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L272 TraceCheckUtils]: 57: Hoare triple {7623#false} call error1(); {7623#false} is VALID [2022-02-20 19:59:28,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {7623#false} assume !false; {7623#false} is VALID [2022-02-20 19:59:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:28,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:28,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807673056] [2022-02-20 19:59:28,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807673056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:28,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:28,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:28,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350114150] [2022-02-20 19:59:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:28,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:28,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:28,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:28,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:28,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:28,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:28,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:28,531 INFO L87 Difference]: Start difference. First operand 666 states and 994 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,222 INFO L93 Difference]: Finished difference Result 968 states and 1409 transitions. [2022-02-20 19:59:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 885 transitions. [2022-02-20 19:59:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 885 transitions. [2022-02-20 19:59:32,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 885 transitions. [2022-02-20 19:59:32,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 885 edges. 885 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:32,808 INFO L225 Difference]: With dead ends: 968 [2022-02-20 19:59:32,809 INFO L226 Difference]: Without dead ends: 700 [2022-02-20 19:59:32,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:32,810 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 968 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:32,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 2833 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:59:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-02-20 19:59:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 671. [2022-02-20 19:59:32,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:32,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:59:32,836 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:59:32,838 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:59:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,866 INFO L93 Difference]: Finished difference Result 700 states and 1038 transitions. [2022-02-20 19:59:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1038 transitions. [2022-02-20 19:59:32,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 700 states. [2022-02-20 19:59:32,870 INFO L87 Difference]: Start difference. First operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 700 states. [2022-02-20 19:59:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,895 INFO L93 Difference]: Finished difference Result 700 states and 1038 transitions. [2022-02-20 19:59:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1038 transitions. [2022-02-20 19:59:32,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:32,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:59:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 997 transitions. [2022-02-20 19:59:32,925 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 997 transitions. Word has length 59 [2022-02-20 19:59:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:32,926 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 997 transitions. [2022-02-20 19:59:32,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 997 transitions. [2022-02-20 19:59:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:32,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:32,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:32,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:32,927 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1521232323, now seen corresponding path program 1 times [2022-02-20 19:59:32,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:32,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203392534] [2022-02-20 19:59:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {11314#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {11315#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:32,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {11315#(not (= |old(~q_req_up~0)| 1))} assume true; {11315#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:32,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11315#(not (= |old(~q_req_up~0)| 1))} {11275#(= ~c_dr_pc~0 ~q_req_up~0)} #1885#return; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {11272#true} is VALID [2022-02-20 19:59:32,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume !(0 == ~q_write_ev~0); {11272#true} is VALID [2022-02-20 19:59:32,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:32,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11279#(not (= ~c_dr_pc~0 1))} #1887#return; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {11272#true} havoc ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume !(1 == ~p_dw_pc~0); {11272#true} is VALID [2022-02-20 19:59:33,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} ~__retres1~0 := 0; {11272#true} is VALID [2022-02-20 19:59:33,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {11272#true} #res := ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,029 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11272#true} {11272#true} #1881#return; {11272#true} is VALID [2022-02-20 19:59:33,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {11272#true} havoc ~__retres1~1; {11272#true} is VALID [2022-02-20 19:59:33,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume 1 == ~c_dr_pc~0; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,037 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} {11272#true} #1883#return; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {11317#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {11272#true} is VALID [2022-02-20 19:59:33,037 INFO L272 TraceCheckUtils]: 1: Hoare triple {11272#true} call #t~ret8 := is_do_write_p_triggered(); {11272#true} is VALID [2022-02-20 19:59:33,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} havoc ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {11272#true} assume !(1 == ~p_dw_pc~0); {11272#true} is VALID [2022-02-20 19:59:33,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {11272#true} ~__retres1~0 := 0; {11272#true} is VALID [2022-02-20 19:59:33,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} #res := ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11272#true} {11272#true} #1881#return; {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11272#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {11272#true} assume !(0 != ~tmp~1); {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L272 TraceCheckUtils]: 10: Hoare triple {11272#true} call #t~ret9 := is_do_read_c_triggered(); {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {11272#true} havoc ~__retres1~1; {11272#true} is VALID [2022-02-20 19:59:33,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {11272#true} assume 1 == ~c_dr_pc~0; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,040 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} {11272#true} #1883#return; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,041 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} {11279#(not (= ~c_dr_pc~0 1))} #1889#return; {11273#false} is VALID [2022-02-20 19:59:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {11272#true} is VALID [2022-02-20 19:59:33,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11272#true} is VALID [2022-02-20 19:59:33,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11273#false} #1891#return; {11273#false} is VALID [2022-02-20 19:59:33,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {11272#true} havoc ~__retres1~2; {11272#true} is VALID [2022-02-20 19:59:33,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11272#true} is VALID [2022-02-20 19:59:33,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} #res := ~__retres1~2; {11272#true} is VALID [2022-02-20 19:59:33,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,051 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11272#true} {11273#false} #1893#return; {11273#false} is VALID [2022-02-20 19:59:33,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {11272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {11274#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:33,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {11274#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {11274#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:33,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {11274#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {11275#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:33,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {11275#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {11275#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:33,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {11275#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {11314#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:33,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {11314#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {11315#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {11315#(not (= |old(~q_req_up~0)| 1))} assume true; {11315#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11315#(not (= |old(~q_req_up~0)| 1))} {11275#(= ~c_dr_pc~0 ~q_req_up~0)} #1885#return; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:33,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {11272#true} is VALID [2022-02-20 19:59:33,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {11272#true} assume !(0 == ~q_write_ev~0); {11272#true} is VALID [2022-02-20 19:59:33,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,057 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11272#true} {11279#(not (= ~c_dr_pc~0 1))} #1887#return; {11279#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:33,058 INFO L272 TraceCheckUtils]: 17: Hoare triple {11279#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {11317#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:33,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {11317#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {11272#true} is VALID [2022-02-20 19:59:33,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {11272#true} call #t~ret8 := is_do_write_p_triggered(); {11272#true} is VALID [2022-02-20 19:59:33,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {11272#true} havoc ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {11272#true} assume !(1 == ~p_dw_pc~0); {11272#true} is VALID [2022-02-20 19:59:33,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {11272#true} ~__retres1~0 := 0; {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {11272#true} #res := ~__retres1~0; {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11272#true} {11272#true} #1881#return; {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {11272#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {11272#true} assume !(0 != ~tmp~1); {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L272 TraceCheckUtils]: 28: Hoare triple {11272#true} call #t~ret9 := is_do_read_c_triggered(); {11272#true} is VALID [2022-02-20 19:59:33,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {11272#true} havoc ~__retres1~1; {11272#true} is VALID [2022-02-20 19:59:33,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {11272#true} assume 1 == ~c_dr_pc~0; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,061 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} {11272#true} #1883#return; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:33,062 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11330#(= (+ (- 1) ~c_dr_pc~0) 0)} {11279#(not (= ~c_dr_pc~0 1))} #1889#return; {11273#false} is VALID [2022-02-20 19:59:33,062 INFO L272 TraceCheckUtils]: 39: Hoare triple {11273#false} call reset_delta_events1(); {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:33,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {11316#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {11272#true} is VALID [2022-02-20 19:59:33,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {11272#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11272#true} is VALID [2022-02-20 19:59:33,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,062 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11272#true} {11273#false} #1891#return; {11273#false} is VALID [2022-02-20 19:59:33,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {11273#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {11273#false} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-02-20 19:59:33,063 INFO L272 TraceCheckUtils]: 47: Hoare triple {11273#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11272#true} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {11272#true} havoc ~__retres1~2; {11272#true} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {11272#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11272#true} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {11272#true} #res := ~__retres1~2; {11272#true} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-02-20 19:59:33,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11272#true} {11273#false} #1893#return; {11273#false} is VALID [2022-02-20 19:59:33,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {11273#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {11273#false} is VALID [2022-02-20 19:59:33,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {11273#false} assume 0 != eval1_~tmp___1~0#1; {11273#false} is VALID [2022-02-20 19:59:33,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {11273#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {11273#false} is VALID [2022-02-20 19:59:33,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {11273#false} assume !(0 != eval1_~tmp~2#1); {11273#false} is VALID [2022-02-20 19:59:33,064 INFO L272 TraceCheckUtils]: 57: Hoare triple {11273#false} call error1(); {11273#false} is VALID [2022-02-20 19:59:33,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-02-20 19:59:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:33,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:33,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203392534] [2022-02-20 19:59:33,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203392534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:33,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:33,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:33,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128731407] [2022-02-20 19:59:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:33,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:59:33,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:33,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:33,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:33,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:33,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:33,096 INFO L87 Difference]: Start difference. First operand 671 states and 997 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,342 INFO L93 Difference]: Finished difference Result 2007 states and 2803 transitions. [2022-02-20 19:59:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:59:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1412 transitions. [2022-02-20 19:59:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1412 transitions. [2022-02-20 19:59:39,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1412 transitions. [2022-02-20 19:59:40,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1412 edges. 1412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:40,601 INFO L225 Difference]: With dead ends: 2007 [2022-02-20 19:59:40,601 INFO L226 Difference]: Without dead ends: 1716 [2022-02-20 19:59:40,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:40,611 INFO L933 BasicCegarLoop]: 821 mSDtfsCounter, 3618 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3632 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:40,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3632 Valid, 2972 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:59:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-02-20 19:59:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1572. [2022-02-20 19:59:40,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:40,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1716 states. Second operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:59:40,715 INFO L74 IsIncluded]: Start isIncluded. First operand 1716 states. Second operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:59:40,719 INFO L87 Difference]: Start difference. First operand 1716 states. Second operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:59:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,823 INFO L93 Difference]: Finished difference Result 1716 states and 2296 transitions. [2022-02-20 19:59:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2296 transitions. [2022-02-20 19:59:40,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1716 states. [2022-02-20 19:59:40,836 INFO L87 Difference]: Start difference. First operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1716 states. [2022-02-20 19:59:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,944 INFO L93 Difference]: Finished difference Result 1716 states and 2296 transitions. [2022-02-20 19:59:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2296 transitions. [2022-02-20 19:59:40,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:40,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:59:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2138 transitions. [2022-02-20 19:59:41,098 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2138 transitions. Word has length 59 [2022-02-20 19:59:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:41,098 INFO L470 AbstractCegarLoop]: Abstraction has 1572 states and 2138 transitions. [2022-02-20 19:59:41,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2138 transitions. [2022-02-20 19:59:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:41,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:41,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:41,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:41,101 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1802060286, now seen corresponding path program 1 times [2022-02-20 19:59:41,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:41,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151148052] [2022-02-20 19:59:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {19663#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {19624#true} is VALID [2022-02-20 19:59:41,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19624#true} {19624#true} #1885#return; {19624#true} is VALID [2022-02-20 19:59:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume !(0 == ~q_write_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19624#true} {19624#true} #1887#return; {19624#true} is VALID [2022-02-20 19:59:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {19624#true} havoc ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume !(1 == ~p_dw_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} ~__retres1~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {19624#true} #res := ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19624#true} {19624#true} #1881#return; {19624#true} is VALID [2022-02-20 19:59:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {19624#true} havoc ~__retres1~1; {19624#true} is VALID [2022-02-20 19:59:41,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume !(1 == ~c_dr_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} ~__retres1~1 := 0; {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:41,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,224 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19624#true} #1883#return; {19678#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:41,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {19665#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {19624#true} is VALID [2022-02-20 19:59:41,224 INFO L272 TraceCheckUtils]: 1: Hoare triple {19624#true} call #t~ret8 := is_do_write_p_triggered(); {19624#true} is VALID [2022-02-20 19:59:41,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} havoc ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {19624#true} assume !(1 == ~p_dw_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {19624#true} ~__retres1~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {19624#true} #res := ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,226 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19624#true} {19624#true} #1881#return; {19624#true} is VALID [2022-02-20 19:59:41,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {19624#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19624#true} is VALID [2022-02-20 19:59:41,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {19624#true} assume !(0 != ~tmp~1); {19624#true} is VALID [2022-02-20 19:59:41,227 INFO L272 TraceCheckUtils]: 10: Hoare triple {19624#true} call #t~ret9 := is_do_read_c_triggered(); {19624#true} is VALID [2022-02-20 19:59:41,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {19624#true} havoc ~__retres1~1; {19624#true} is VALID [2022-02-20 19:59:41,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {19624#true} assume !(1 == ~c_dr_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {19624#true} ~__retres1~1 := 0; {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:41,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19624#true} #1883#return; {19678#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:41,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {19678#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {19679#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:41,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {19679#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19625#false} is VALID [2022-02-20 19:59:41,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {19625#false} assume true; {19625#false} is VALID [2022-02-20 19:59:41,229 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19625#false} {19624#true} #1889#return; {19625#false} is VALID [2022-02-20 19:59:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19624#true} is VALID [2022-02-20 19:59:41,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19624#true} {19625#false} #1891#return; {19625#false} is VALID [2022-02-20 19:59:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {19624#true} havoc ~__retres1~2; {19624#true} is VALID [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19624#true} is VALID [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} #res := ~__retres1~2; {19624#true} is VALID [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,242 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19624#true} {19625#false} #1893#return; {19625#false} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {19624#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {19624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {19624#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {19624#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {19624#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {19624#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {19624#true} is VALID [2022-02-20 19:59:41,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {19624#true} call update_channels1(); {19663#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {19663#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19624#true} {19624#true} #1885#return; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {19624#true} assume { :begin_inline_init_threads1 } true; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {19624#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {19624#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {19624#true} assume { :end_inline_init_threads1 } true; {19624#true} is VALID [2022-02-20 19:59:41,244 INFO L272 TraceCheckUtils]: 12: Hoare triple {19624#true} call fire_delta_events1(); {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:41,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {19624#true} assume !(0 == ~q_write_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19624#true} {19624#true} #1887#return; {19624#true} is VALID [2022-02-20 19:59:41,245 INFO L272 TraceCheckUtils]: 17: Hoare triple {19624#true} call activate_threads1(); {19665#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:41,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {19665#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {19624#true} is VALID [2022-02-20 19:59:41,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {19624#true} call #t~ret8 := is_do_write_p_triggered(); {19624#true} is VALID [2022-02-20 19:59:41,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {19624#true} havoc ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {19624#true} assume !(1 == ~p_dw_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {19624#true} ~__retres1~0 := 0; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {19624#true} #res := ~__retres1~0; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19624#true} {19624#true} #1881#return; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {19624#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {19624#true} assume !(0 != ~tmp~1); {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L272 TraceCheckUtils]: 28: Hoare triple {19624#true} call #t~ret9 := is_do_read_c_triggered(); {19624#true} is VALID [2022-02-20 19:59:41,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {19624#true} havoc ~__retres1~1; {19624#true} is VALID [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {19624#true} assume !(1 == ~c_dr_pc~0); {19624#true} is VALID [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {19624#true} ~__retres1~1 := 0; {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {19680#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:41,250 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19681#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19624#true} #1883#return; {19678#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:41,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {19678#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {19679#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:41,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {19679#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19625#false} is VALID [2022-02-20 19:59:41,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {19625#false} assume true; {19625#false} is VALID [2022-02-20 19:59:41,251 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19625#false} {19624#true} #1889#return; {19625#false} is VALID [2022-02-20 19:59:41,251 INFO L272 TraceCheckUtils]: 39: Hoare triple {19625#false} call reset_delta_events1(); {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:41,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {19664#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {19624#true} is VALID [2022-02-20 19:59:41,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {19624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19624#true} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,252 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19624#true} {19625#false} #1891#return; {19625#false} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {19625#false} assume !false; {19625#false} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {19625#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {19625#false} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {19625#false} assume !false; {19625#false} is VALID [2022-02-20 19:59:41,252 INFO L272 TraceCheckUtils]: 47: Hoare triple {19625#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19624#true} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {19624#true} havoc ~__retres1~2; {19624#true} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {19624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19624#true} is VALID [2022-02-20 19:59:41,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {19624#true} #res := ~__retres1~2; {19624#true} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {19624#true} assume true; {19624#true} is VALID [2022-02-20 19:59:41,253 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19624#true} {19625#false} #1893#return; {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {19625#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {19625#false} assume 0 != eval1_~tmp___1~0#1; {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {19625#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {19625#false} assume !(0 != eval1_~tmp~2#1); {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L272 TraceCheckUtils]: 57: Hoare triple {19625#false} call error1(); {19625#false} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {19625#false} assume !false; {19625#false} is VALID [2022-02-20 19:59:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:41,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:41,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151148052] [2022-02-20 19:59:41,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151148052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:41,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:41,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:41,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947349953] [2022-02-20 19:59:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:41,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:41,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:41,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:41,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:41,285 INFO L87 Difference]: Start difference. First operand 1572 states and 2138 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,988 INFO L93 Difference]: Finished difference Result 2864 states and 3812 transitions. [2022-02-20 19:59:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 884 transitions. [2022-02-20 19:59:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 884 transitions. [2022-02-20 19:59:45,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 884 transitions. [2022-02-20 19:59:45,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 884 edges. 884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,705 INFO L225 Difference]: With dead ends: 2864 [2022-02-20 19:59:45,705 INFO L226 Difference]: Without dead ends: 1678 [2022-02-20 19:59:45,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:45,708 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 969 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:45,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 2828 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-02-20 19:59:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1602. [2022-02-20 19:59:45,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:45,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1678 states. Second operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:59:45,786 INFO L74 IsIncluded]: Start isIncluded. First operand 1678 states. Second operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:59:45,788 INFO L87 Difference]: Start difference. First operand 1678 states. Second operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:59:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,884 INFO L93 Difference]: Finished difference Result 1678 states and 2251 transitions. [2022-02-20 19:59:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2251 transitions. [2022-02-20 19:59:45,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1678 states. [2022-02-20 19:59:45,892 INFO L87 Difference]: Start difference. First operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1678 states. [2022-02-20 19:59:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,000 INFO L93 Difference]: Finished difference Result 1678 states and 2251 transitions. [2022-02-20 19:59:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2251 transitions. [2022-02-20 19:59:46,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:46,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:59:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2160 transitions. [2022-02-20 19:59:46,136 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2160 transitions. Word has length 59 [2022-02-20 19:59:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:46,136 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 2160 transitions. [2022-02-20 19:59:46,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2160 transitions. [2022-02-20 19:59:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:46,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:46,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:46,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:46,138 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash -3378048, now seen corresponding path program 1 times [2022-02-20 19:59:46,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:46,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117304808] [2022-02-20 19:59:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {29073#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1885#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1887#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {29033#true} havoc ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {29033#true} assume !(1 == ~p_dw_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {29033#true} ~__retres1~0 := 0; {29033#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {29033#true} #res := ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,201 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29033#true} {29033#true} #1881#return; {29033#true} is VALID [2022-02-20 19:59:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {29033#true} havoc ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {29033#true} assume !(1 == ~c_dr_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {29033#true} ~__retres1~1 := 0; {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {29033#true} #res := ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29033#true} {29033#true} #1883#return; {29033#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {29075#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L272 TraceCheckUtils]: 1: Hoare triple {29033#true} call #t~ret8 := is_do_write_p_triggered(); {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {29033#true} havoc ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {29033#true} assume !(1 == ~p_dw_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {29033#true} ~__retres1~0 := 0; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {29033#true} #res := ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29033#true} {29033#true} #1881#return; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {29033#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29033#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {29033#true} assume !(0 != ~tmp~1); {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L272 TraceCheckUtils]: 10: Hoare triple {29033#true} call #t~ret9 := is_do_read_c_triggered(); {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {29033#true} havoc ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {29033#true} assume !(1 == ~c_dr_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {29033#true} ~__retres1~1 := 0; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {29033#true} #res := ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29033#true} {29033#true} #1883#return; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {29033#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29033#true} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {29033#true} assume !(0 != ~tmp___0~1); {29033#true} is VALID [2022-02-20 19:59:46,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,206 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29033#true} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1889#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {29088#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:46,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {29088#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1891#return; {29034#false} is VALID [2022-02-20 19:59:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {29033#true} havoc ~__retres1~2; {29033#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {29033#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29033#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {29033#true} #res := ~__retres1~2; {29033#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,227 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29033#true} {29034#false} #1893#return; {29034#false} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {29033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {29033#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {29033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {29033#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {29033#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29073#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:46,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {29073#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,229 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1885#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1887#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29075#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {29075#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {29033#true} call #t~ret8 := is_do_write_p_triggered(); {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {29033#true} havoc ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {29033#true} assume !(1 == ~p_dw_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {29033#true} ~__retres1~0 := 0; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {29033#true} #res := ~__retres1~0; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29033#true} {29033#true} #1881#return; {29033#true} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {29033#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {29033#true} assume !(0 != ~tmp~1); {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L272 TraceCheckUtils]: 28: Hoare triple {29033#true} call #t~ret9 := is_do_read_c_triggered(); {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {29033#true} havoc ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {29033#true} assume !(1 == ~c_dr_pc~0); {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {29033#true} ~__retres1~1 := 0; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {29033#true} #res := ~__retres1~1; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29033#true} {29033#true} #1883#return; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {29033#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29033#true} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {29033#true} assume !(0 != ~tmp___0~1); {29033#true} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,235 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29033#true} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1889#return; {29035#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,235 INFO L272 TraceCheckUtils]: 39: Hoare triple {29035#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {29074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {29088#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {29088#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,237 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29089#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29035#(= ~q_write_ev~0 ~q_read_ev~0)} #1891#return; {29034#false} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {29034#false} assume !false; {29034#false} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {29034#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {29034#false} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {29034#false} assume !false; {29034#false} is VALID [2022-02-20 19:59:46,237 INFO L272 TraceCheckUtils]: 47: Hoare triple {29034#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29033#true} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {29033#true} havoc ~__retres1~2; {29033#true} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {29033#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29033#true} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {29033#true} #res := ~__retres1~2; {29033#true} is VALID [2022-02-20 19:59:46,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {29033#true} assume true; {29033#true} is VALID [2022-02-20 19:59:46,238 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29033#true} {29034#false} #1893#return; {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {29034#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {29034#false} assume 0 != eval1_~tmp___1~0#1; {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {29034#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {29034#false} assume !(0 != eval1_~tmp~2#1); {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L272 TraceCheckUtils]: 57: Hoare triple {29034#false} call error1(); {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {29034#false} assume !false; {29034#false} is VALID [2022-02-20 19:59:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:46,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:46,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117304808] [2022-02-20 19:59:46,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117304808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:46,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039651114] [2022-02-20 19:59:46,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:46,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:46,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:46,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:46,276 INFO L87 Difference]: Start difference. First operand 1602 states and 2160 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,087 INFO L93 Difference]: Finished difference Result 2859 states and 3709 transitions. [2022-02-20 19:59:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:50,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1043 transitions. [2022-02-20 19:59:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1043 transitions. [2022-02-20 19:59:50,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1043 transitions. [2022-02-20 19:59:50,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1043 edges. 1043 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,774 INFO L225 Difference]: With dead ends: 2859 [2022-02-20 19:59:50,774 INFO L226 Difference]: Without dead ends: 1866 [2022-02-20 19:59:50,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:50,777 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 1437 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:50,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 2432 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-02-20 19:59:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1544. [2022-02-20 19:59:50,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:50,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1866 states. Second operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:59:50,891 INFO L74 IsIncluded]: Start isIncluded. First operand 1866 states. Second operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:59:50,892 INFO L87 Difference]: Start difference. First operand 1866 states. Second operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:59:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,023 INFO L93 Difference]: Finished difference Result 1866 states and 2423 transitions. [2022-02-20 19:59:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2423 transitions. [2022-02-20 19:59:51,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1866 states. [2022-02-20 19:59:51,033 INFO L87 Difference]: Start difference. First operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1866 states. [2022-02-20 19:59:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,161 INFO L93 Difference]: Finished difference Result 1866 states and 2423 transitions. [2022-02-20 19:59:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2423 transitions. [2022-02-20 19:59:51,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:59:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2078 transitions. [2022-02-20 19:59:51,304 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2078 transitions. Word has length 59 [2022-02-20 19:59:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,304 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 2078 transitions. [2022-02-20 19:59:51,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2078 transitions. [2022-02-20 19:59:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:51,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:51,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1997522754, now seen corresponding path program 1 times [2022-02-20 19:59:51,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:51,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921518412] [2022-02-20 19:59:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:51,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:51,363 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:51,364 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:51,365 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:51,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:51,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:51,370 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,372 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:51,437 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:51,438 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:51,443 INFO L158 Benchmark]: Toolchain (without parser) took 34457.90ms. Allocated memory was 79.7MB in the beginning and 373.3MB in the end (delta: 293.6MB). Free memory was 40.7MB in the beginning and 230.6MB in the end (delta: -189.9MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,443 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:51,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.12ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 51.6MB in the end (delta: -11.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.01ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 45.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,444 INFO L158 Benchmark]: Boogie Preprocessor took 60.11ms. Allocated memory is still 96.5MB. Free memory was 45.9MB in the beginning and 40.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,444 INFO L158 Benchmark]: RCFGBuilder took 822.35ms. Allocated memory is still 96.5MB. Free memory was 40.6MB in the beginning and 56.4MB in the end (delta: -15.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,444 INFO L158 Benchmark]: TraceAbstraction took 33051.24ms. Allocated memory was 96.5MB in the beginning and 373.3MB in the end (delta: 276.8MB). Free memory was 55.8MB in the beginning and 230.6MB in the end (delta: -174.7MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,446 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.12ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 51.6MB in the end (delta: -11.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.01ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 45.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.11ms. Allocated memory is still 96.5MB. Free memory was 45.9MB in the beginning and 40.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 822.35ms. Allocated memory is still 96.5MB. Free memory was 40.6MB in the beginning and 56.4MB in the end (delta: -15.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33051.24ms. Allocated memory was 96.5MB in the beginning and 373.3MB in the end (delta: 276.8MB). Free memory was 55.8MB in the beginning and 230.6MB in the end (delta: -174.7MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:51,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:53,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:53,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:53,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:53,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:53,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:53,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:53,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:53,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:53,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:53,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:53,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:53,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:53,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:53,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:53,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:53,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:53,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:53,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:53,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:53,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:53,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:53,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:53,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:53,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:53,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:53,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:53,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:53,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:53,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:53,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:53,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:53,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:53,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:53,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:53,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:53,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:53,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:53,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:53,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:53,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:53,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:59:53,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:53,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:53,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:53,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:53,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:53,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:53,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:53,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:53,405 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:53,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:53,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:53,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:53,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:53,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:53,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:53,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:53,406 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:53,406 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:53,407 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:53,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:53,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:53,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:53,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:53,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:53,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:53,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:53,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:53,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:53,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:53,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:53,413 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:53,413 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:53,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:53,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:53,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:53,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:53,414 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba [2022-02-20 19:59:53,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:53,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:53,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:53,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:53,703 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:53,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:53,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cec89a4/51bfe7c1e4ea4ee4b0b243586535bc73/FLAGbdb4e815d [2022-02-20 19:59:54,097 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:54,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:54,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cec89a4/51bfe7c1e4ea4ee4b0b243586535bc73/FLAGbdb4e815d [2022-02-20 19:59:54,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cec89a4/51bfe7c1e4ea4ee4b0b243586535bc73 [2022-02-20 19:59:54,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:54,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:54,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:54,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:54,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:54,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:54,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c02579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54, skipping insertion in model container [2022-02-20 19:59:54,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:54,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:54,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:54,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2022-02-20 19:59:54,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2022-02-20 19:59:54,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:54,792 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:54,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2022-02-20 19:59:54,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2022-02-20 19:59:54,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:54,913 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:54,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54 WrapperNode [2022-02-20 19:59:54,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:54,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:54,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:54,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:54,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:54,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:54,988 INFO L137 Inliner]: procedures = 78, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1002 [2022-02-20 19:59:54,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:54,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:54,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:54,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:55,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:55,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:55,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:55,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:55,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (1/1) ... [2022-02-20 19:59:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:55,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:55,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:55,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:55,186 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:55,186 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:55,186 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:55,186 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:55,189 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:55,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:55,189 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:55,315 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:55,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:56,028 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:56,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:56,039 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 19:59:56,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:56 BoogieIcfgContainer [2022-02-20 19:59:56,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:56,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:56,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:56,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:56,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:54" (1/3) ... [2022-02-20 19:59:56,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec575d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:56, skipping insertion in model container [2022-02-20 19:59:56,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:54" (2/3) ... [2022-02-20 19:59:56,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec575d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:56, skipping insertion in model container [2022-02-20 19:59:56,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:56" (3/3) ... [2022-02-20 19:59:56,045 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2022-02-20 19:59:56,049 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:56,049 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:56,082 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:56,097 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:56,097 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 19:59:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:56,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:56,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:56,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash -322783681, now seen corresponding path program 1 times [2022-02-20 19:59:56,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:56,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415090802] [2022-02-20 19:59:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:56,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:56,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:59:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:56,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:56,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:56,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {487#true} is VALID [2022-02-20 19:59:56,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1; {487#true} is VALID [2022-02-20 19:59:56,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume 0bv32 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,500 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {498#(= (_ bv2 32) ~q_read_ev~0)} #1885#return; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {498#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,502 INFO L272 TraceCheckUtils]: 12: Hoare triple {498#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:56,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {533#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:56,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {533#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:56,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {533#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {533#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:56,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {533#(= |old(~q_read_ev~0)| (_ bv0 32))} {498#(= (_ bv2 32) ~q_read_ev~0)} #1887#return; {488#false} is VALID [2022-02-20 19:59:56,504 INFO L272 TraceCheckUtils]: 17: Hoare triple {488#false} call activate_threads1(); {488#false} is VALID [2022-02-20 19:59:56,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#false} havoc ~tmp~1;havoc ~tmp___0~1; {488#false} is VALID [2022-02-20 19:59:56,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {488#false} call #t~ret8 := is_do_write_p_triggered(); {488#false} is VALID [2022-02-20 19:59:56,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#false} havoc ~__retres1~0; {488#false} is VALID [2022-02-20 19:59:56,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {488#false} assume !(1bv32 == ~p_dw_pc~0); {488#false} is VALID [2022-02-20 19:59:56,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {488#false} ~__retres1~0 := 0bv32; {488#false} is VALID [2022-02-20 19:59:56,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {488#false} #res := ~__retres1~0; {488#false} is VALID [2022-02-20 19:59:56,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {488#false} assume true; {488#false} is VALID [2022-02-20 19:59:56,507 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {488#false} {488#false} #1881#return; {488#false} is VALID [2022-02-20 19:59:56,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {488#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {488#false} is VALID [2022-02-20 19:59:56,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {488#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {488#false} is VALID [2022-02-20 19:59:56,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {488#false} call #t~ret9 := is_do_read_c_triggered(); {488#false} is VALID [2022-02-20 19:59:56,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {488#false} havoc ~__retres1~1; {488#false} is VALID [2022-02-20 19:59:56,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {488#false} assume 1bv32 == ~c_dr_pc~0; {488#false} is VALID [2022-02-20 19:59:56,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {488#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {488#false} is VALID [2022-02-20 19:59:56,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {488#false} #res := ~__retres1~1; {488#false} is VALID [2022-02-20 19:59:56,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {488#false} assume true; {488#false} is VALID [2022-02-20 19:59:56,519 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {488#false} {488#false} #1883#return; {488#false} is VALID [2022-02-20 19:59:56,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {488#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {488#false} is VALID [2022-02-20 19:59:56,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {488#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {488#false} is VALID [2022-02-20 19:59:56,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {488#false} assume true; {488#false} is VALID [2022-02-20 19:59:56,520 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {488#false} {488#false} #1889#return; {488#false} is VALID [2022-02-20 19:59:56,521 INFO L272 TraceCheckUtils]: 39: Hoare triple {488#false} call reset_delta_events1(); {488#false} is VALID [2022-02-20 19:59:56,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {488#false} assume !(1bv32 == ~q_read_ev~0); {488#false} is VALID [2022-02-20 19:59:56,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {488#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {488#false} is VALID [2022-02-20 19:59:56,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {488#false} assume true; {488#false} is VALID [2022-02-20 19:59:56,524 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {488#false} {488#false} #1891#return; {488#false} is VALID [2022-02-20 19:59:56,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:56,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {488#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {488#false} is VALID [2022-02-20 19:59:56,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:56,525 INFO L272 TraceCheckUtils]: 47: Hoare triple {488#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {488#false} is VALID [2022-02-20 19:59:56,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {488#false} havoc ~__retres1~2; {488#false} is VALID [2022-02-20 19:59:56,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {488#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {488#false} is VALID [2022-02-20 19:59:56,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {488#false} #res := ~__retres1~2; {488#false} is VALID [2022-02-20 19:59:56,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {488#false} assume true; {488#false} is VALID [2022-02-20 19:59:56,533 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {488#false} {488#false} #1893#return; {488#false} is VALID [2022-02-20 19:59:56,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {488#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {488#false} is VALID [2022-02-20 19:59:56,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {488#false} assume 0bv32 != eval1_~tmp___1~0#1; {488#false} is VALID [2022-02-20 19:59:56,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {488#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {488#false} is VALID [2022-02-20 19:59:56,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {488#false} assume !(0bv32 != eval1_~tmp~2#1); {488#false} is VALID [2022-02-20 19:59:56,536 INFO L272 TraceCheckUtils]: 57: Hoare triple {488#false} call error1(); {488#false} is VALID [2022-02-20 19:59:56,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-02-20 19:59:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:56,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:56,538 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:56,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415090802] [2022-02-20 19:59:56,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415090802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:56,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:56,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:56,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103286401] [2022-02-20 19:59:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:56,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:56,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:56,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:56,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:56,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:56,637 INFO L87 Difference]: Start difference. First operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,979 INFO L93 Difference]: Finished difference Result 1044 states and 1676 transitions. [2022-02-20 19:59:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:58,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1676 transitions. [2022-02-20 19:59:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1676 transitions. [2022-02-20 19:59:59,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1676 transitions. [2022-02-20 20:00:00,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1676 edges. 1676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:00,323 INFO L225 Difference]: With dead ends: 1044 [2022-02-20 20:00:00,323 INFO L226 Difference]: Without dead ends: 578 [2022-02-20 20:00:00,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:00,333 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 478 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:00,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 1885 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:00:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-02-20 20:00:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2022-02-20 20:00:00,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:00,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 578 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 20:00:00,403 INFO L74 IsIncluded]: Start isIncluded. First operand 578 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 20:00:00,405 INFO L87 Difference]: Start difference. First operand 578 states. Second operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 20:00:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,428 INFO L93 Difference]: Finished difference Result 578 states and 869 transitions. [2022-02-20 20:00:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 869 transitions. [2022-02-20 20:00:00,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 578 states. [2022-02-20 20:00:00,435 INFO L87 Difference]: Start difference. First operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 578 states. [2022-02-20 20:00:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,455 INFO L93 Difference]: Finished difference Result 578 states and 869 transitions. [2022-02-20 20:00:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 869 transitions. [2022-02-20 20:00:00,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:00,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 20:00:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 860 transitions. [2022-02-20 20:00:00,480 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 860 transitions. Word has length 59 [2022-02-20 20:00:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:00,481 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 860 transitions. [2022-02-20 20:00:00,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2022-02-20 20:00:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:00,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:00,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:00,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 20:00:00,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 20:00:00,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1605489021, now seen corresponding path program 1 times [2022-02-20 20:00:00,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:00,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433355639] [2022-02-20 20:00:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:00,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 20:00:00,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 20:00:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 20:00:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:00,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {3953#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3953#true} is VALID [2022-02-20 20:00:00,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {3953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1; {3953#true} is VALID [2022-02-20 20:00:00,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#true} assume 0bv32 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:00,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:00,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 20:00:00,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,001 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {3964#(= (_ bv2 32) ~q_write_ev~0)} #1885#return; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {3964#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,003 INFO L272 TraceCheckUtils]: 12: Hoare triple {3964#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 20:00:01,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {3971#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {4002#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 20:00:01,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {4002#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {4002#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 20:00:01,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4002#(= |old(~q_write_ev~0)| (_ bv0 32))} {3964#(= (_ bv2 32) ~q_write_ev~0)} #1887#return; {3954#false} is VALID [2022-02-20 20:00:01,004 INFO L272 TraceCheckUtils]: 17: Hoare triple {3954#false} call activate_threads1(); {3954#false} is VALID [2022-02-20 20:00:01,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {3954#false} havoc ~tmp~1;havoc ~tmp___0~1; {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {3954#false} call #t~ret8 := is_do_write_p_triggered(); {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#false} havoc ~__retres1~0; {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {3954#false} assume !(1bv32 == ~p_dw_pc~0); {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {3954#false} ~__retres1~0 := 0bv32; {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {3954#false} #res := ~__retres1~0; {3954#false} is VALID [2022-02-20 20:00:01,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {3954#false} assume true; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3954#false} {3954#false} #1881#return; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {3954#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L272 TraceCheckUtils]: 28: Hoare triple {3954#false} call #t~ret9 := is_do_read_c_triggered(); {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {3954#false} havoc ~__retres1~1; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {3954#false} assume 1bv32 == ~c_dr_pc~0; {3954#false} is VALID [2022-02-20 20:00:01,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {3954#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#false} #res := ~__retres1~1; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {3954#false} assume true; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3954#false} {3954#false} #1883#return; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {3954#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {3954#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3954#false} is VALID [2022-02-20 20:00:01,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {3954#false} assume true; {3954#false} is VALID [2022-02-20 20:00:01,009 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3954#false} {3954#false} #1889#return; {3954#false} is VALID [2022-02-20 20:00:01,009 INFO L272 TraceCheckUtils]: 39: Hoare triple {3954#false} call reset_delta_events1(); {3954#false} is VALID [2022-02-20 20:00:01,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {3954#false} assume !(1bv32 == ~q_read_ev~0); {3954#false} is VALID [2022-02-20 20:00:01,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {3954#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {3954#false} assume true; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3954#false} {3954#false} #1891#return; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {3954#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 20:00:01,010 INFO L272 TraceCheckUtils]: 47: Hoare triple {3954#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {3954#false} havoc ~__retres1~2; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {3954#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {3954#false} #res := ~__retres1~2; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {3954#false} assume true; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3954#false} {3954#false} #1893#return; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {3954#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3954#false} is VALID [2022-02-20 20:00:01,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {3954#false} assume 0bv32 != eval1_~tmp___1~0#1; {3954#false} is VALID [2022-02-20 20:00:01,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {3954#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3954#false} is VALID [2022-02-20 20:00:01,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {3954#false} assume !(0bv32 != eval1_~tmp~2#1); {3954#false} is VALID [2022-02-20 20:00:01,012 INFO L272 TraceCheckUtils]: 57: Hoare triple {3954#false} call error1(); {3954#false} is VALID [2022-02-20 20:00:01,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {3954#false} assume !false; {3954#false} is VALID [2022-02-20 20:00:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:01,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:01,013 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:01,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433355639] [2022-02-20 20:00:01,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433355639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:01,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:01,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:01,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130511747] [2022-02-20 20:00:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:01,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:01,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:01,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:01,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:01,063 INFO L87 Difference]: Start difference. First operand 570 states and 860 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,550 INFO L93 Difference]: Finished difference Result 964 states and 1416 transitions. [2022-02-20 20:00:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2022-02-20 20:00:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2022-02-20 20:00:03,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 997 transitions. [2022-02-20 20:00:04,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 997 edges. 997 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:04,340 INFO L225 Difference]: With dead ends: 964 [2022-02-20 20:00:04,341 INFO L226 Difference]: Without dead ends: 784 [2022-02-20 20:00:04,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:04,342 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 465 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:04,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1815 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-02-20 20:00:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 775. [2022-02-20 20:00:04,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:04,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 784 states. Second operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) [2022-02-20 20:00:04,393 INFO L74 IsIncluded]: Start isIncluded. First operand 784 states. Second operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) [2022-02-20 20:00:04,394 INFO L87 Difference]: Start difference. First operand 784 states. Second operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) [2022-02-20 20:00:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,420 INFO L93 Difference]: Finished difference Result 784 states and 1150 transitions. [2022-02-20 20:00:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1150 transitions. [2022-02-20 20:00:04,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) Second operand 784 states. [2022-02-20 20:00:04,425 INFO L87 Difference]: Start difference. First operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) Second operand 784 states. [2022-02-20 20:00:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,450 INFO L93 Difference]: Finished difference Result 784 states and 1150 transitions. [2022-02-20 20:00:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1150 transitions. [2022-02-20 20:00:04,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:04,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 655 states have (on average 1.4809160305343512) internal successors, (970), 670 states have internal predecessors, (970), 74 states have call successors, (74), 35 states have call predecessors, (74), 44 states have return successors, (96), 74 states have call predecessors, (96), 71 states have call successors, (96) [2022-02-20 20:00:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1140 transitions. [2022-02-20 20:00:04,482 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1140 transitions. Word has length 59 [2022-02-20 20:00:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:04,482 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1140 transitions. [2022-02-20 20:00:04,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1140 transitions. [2022-02-20 20:00:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:04,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:04,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:04,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 20:00:04,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 20:00:04,692 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -466844034, now seen corresponding path program 1 times [2022-02-20 20:00:04,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:04,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605187676] [2022-02-20 20:00:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:04,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:04,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:04,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 20:00:04,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 20:00:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 20:00:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:04,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {8022#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {8022#true} is VALID [2022-02-20 20:00:04,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1; {8022#true} is VALID [2022-02-20 20:00:04,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume 0bv32 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {8022#true} is VALID [2022-02-20 20:00:04,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {8022#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {8022#true} is VALID [2022-02-20 20:00:04,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call update_channels1(); {8022#true} is VALID [2022-02-20 20:00:04,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#true} assume !(1bv32 == ~q_req_up~0); {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8022#true} {8022#true} #1885#return; {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume { :begin_inline_init_threads1 } true; {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {8022#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8022#true} is VALID [2022-02-20 20:00:04,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {8022#true} assume { :end_inline_init_threads1 } true; {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L272 TraceCheckUtils]: 12: Hoare triple {8022#true} call fire_delta_events1(); {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0bv32 == ~q_read_ev~0); {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume !(0bv32 == ~q_write_ev~0); {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8022#true} {8022#true} #1887#return; {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L272 TraceCheckUtils]: 17: Hoare triple {8022#true} call activate_threads1(); {8022#true} is VALID [2022-02-20 20:00:04,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {8022#true} havoc ~tmp~1;havoc ~tmp___0~1; {8022#true} is VALID [2022-02-20 20:00:04,968 INFO L272 TraceCheckUtils]: 19: Hoare triple {8022#true} call #t~ret8 := is_do_write_p_triggered(); {8022#true} is VALID [2022-02-20 20:00:04,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} havoc ~__retres1~0; {8022#true} is VALID [2022-02-20 20:00:04,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(1bv32 == ~p_dw_pc~0); {8022#true} is VALID [2022-02-20 20:00:04,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} ~__retres1~0 := 0bv32; {8093#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 20:00:04,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {8093#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {8097#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:04,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {8097#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {8097#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:04,970 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8097#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {8022#true} #1881#return; {8104#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 20:00:04,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {8104#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {8108#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 20:00:04,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8108#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {8023#false} is VALID [2022-02-20 20:00:04,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {8023#false} call #t~ret9 := is_do_read_c_triggered(); {8023#false} is VALID [2022-02-20 20:00:04,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {8023#false} havoc ~__retres1~1; {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {8023#false} assume !(1bv32 == ~c_dr_pc~0); {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {8023#false} ~__retres1~1 := 0bv32; {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {8023#false} #res := ~__retres1~1; {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8023#false} {8023#false} #1883#return; {8023#false} is VALID [2022-02-20 20:00:04,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {8023#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {8023#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8023#false} {8022#true} #1889#return; {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L272 TraceCheckUtils]: 39: Hoare triple {8023#false} call reset_delta_events1(); {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {8023#false} assume !(1bv32 == ~q_read_ev~0); {8023#false} is VALID [2022-02-20 20:00:04,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {8023#false} assume !(1bv32 == ~q_write_ev~0); {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8023#false} {8023#false} #1891#return; {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {8023#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L272 TraceCheckUtils]: 47: Hoare triple {8023#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8023#false} is VALID [2022-02-20 20:00:04,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {8023#false} havoc ~__retres1~2; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {8023#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {8023#false} #res := ~__retres1~2; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8023#false} {8023#false} #1893#return; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {8023#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8023#false} is VALID [2022-02-20 20:00:04,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {8023#false} assume 0bv32 != eval1_~tmp___1~0#1; {8023#false} is VALID [2022-02-20 20:00:04,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {8023#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8023#false} is VALID [2022-02-20 20:00:04,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {8023#false} assume !(0bv32 != eval1_~tmp~2#1); {8023#false} is VALID [2022-02-20 20:00:04,976 INFO L272 TraceCheckUtils]: 57: Hoare triple {8023#false} call error1(); {8023#false} is VALID [2022-02-20 20:00:04,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-02-20 20:00:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:04,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:04,977 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:04,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605187676] [2022-02-20 20:00:04,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605187676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:04,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:04,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:04,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994781361] [2022-02-20 20:00:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:04,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:04,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:05,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:05,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:05,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:05,041 INFO L87 Difference]: Start difference. First operand 775 states and 1140 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,592 INFO L93 Difference]: Finished difference Result 1166 states and 1673 transitions. [2022-02-20 20:00:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2022-02-20 20:00:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2022-02-20 20:00:06,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 862 transitions. [2022-02-20 20:00:07,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 862 edges. 862 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:07,206 INFO L225 Difference]: With dead ends: 1166 [2022-02-20 20:00:07,207 INFO L226 Difference]: Without dead ends: 795 [2022-02-20 20:00:07,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:07,210 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 7 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:07,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3624 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 20:00:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-02-20 20:00:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 785. [2022-02-20 20:00:07,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:07,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) [2022-02-20 20:00:07,238 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) [2022-02-20 20:00:07,239 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) [2022-02-20 20:00:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,264 INFO L93 Difference]: Finished difference Result 795 states and 1164 transitions. [2022-02-20 20:00:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1164 transitions. [2022-02-20 20:00:07,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) Second operand 795 states. [2022-02-20 20:00:07,270 INFO L87 Difference]: Start difference. First operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) Second operand 795 states. [2022-02-20 20:00:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,295 INFO L93 Difference]: Finished difference Result 795 states and 1164 transitions. [2022-02-20 20:00:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1164 transitions. [2022-02-20 20:00:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:07,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 663 states have (on average 1.4720965309200604) internal successors, (976), 678 states have internal predecessors, (976), 74 states have call successors, (74), 35 states have call predecessors, (74), 46 states have return successors, (98), 76 states have call predecessors, (98), 71 states have call successors, (98) [2022-02-20 20:00:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1148 transitions. [2022-02-20 20:00:07,328 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1148 transitions. Word has length 59 [2022-02-20 20:00:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:07,328 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1148 transitions. [2022-02-20 20:00:07,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1148 transitions. [2022-02-20 20:00:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:07,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:07,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:07,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 20:00:07,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 20:00:07,540 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -192084420, now seen corresponding path program 1 times [2022-02-20 20:00:07,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:07,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091430468] [2022-02-20 20:00:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:07,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:07,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 20:00:07,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 20:00:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 20:00:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:07,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {12392#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {12392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1; {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {12392#true} assume 0bv32 != main_#t~nondet50#1;havoc main_#t~nondet50#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {12392#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {12392#true} call update_channels1(); {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {12392#true} assume !(1bv32 == ~q_req_up~0); {12392#true} is VALID [2022-02-20 20:00:07,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {12392#true} assume true; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12392#true} {12392#true} #1885#return; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {12392#true} assume { :begin_inline_init_threads1 } true; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {12392#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {12392#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {12392#true} assume { :end_inline_init_threads1 } true; {12392#true} is VALID [2022-02-20 20:00:07,810 INFO L272 TraceCheckUtils]: 12: Hoare triple {12392#true} call fire_delta_events1(); {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {12392#true} assume !(0bv32 == ~q_read_ev~0); {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {12392#true} assume !(0bv32 == ~q_write_ev~0); {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {12392#true} assume true; {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12392#true} {12392#true} #1887#return; {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L272 TraceCheckUtils]: 17: Hoare triple {12392#true} call activate_threads1(); {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {12392#true} havoc ~tmp~1;havoc ~tmp___0~1; {12392#true} is VALID [2022-02-20 20:00:07,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {12392#true} call #t~ret8 := is_do_write_p_triggered(); {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {12392#true} havoc ~__retres1~0; {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {12392#true} assume !(1bv32 == ~p_dw_pc~0); {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {12392#true} ~__retres1~0 := 0bv32; {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {12392#true} #res := ~__retres1~0; {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {12392#true} assume true; {12392#true} is VALID [2022-02-20 20:00:07,812 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12392#true} {12392#true} #1881#return; {12392#true} is VALID [2022-02-20 20:00:07,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {12392#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {12392#true} is VALID [2022-02-20 20:00:07,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {12392#true} assume !(0bv32 != ~tmp~1); {12392#true} is VALID [2022-02-20 20:00:07,813 INFO L272 TraceCheckUtils]: 28: Hoare triple {12392#true} call #t~ret9 := is_do_read_c_triggered(); {12392#true} is VALID [2022-02-20 20:00:07,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {12392#true} havoc ~__retres1~1; {12392#true} is VALID [2022-02-20 20:00:07,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {12392#true} assume !(1bv32 == ~c_dr_pc~0); {12392#true} is VALID [2022-02-20 20:00:07,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {12392#true} ~__retres1~1 := 0bv32; {12490#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 20:00:07,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {12490#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {12494#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:07,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {12494#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {12494#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:07,815 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12494#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {12392#true} #1883#return; {12501#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:07,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {12501#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {12505#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 20:00:07,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {12505#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {12393#false} is VALID [2022-02-20 20:00:07,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {12393#false} assume true; {12393#false} is VALID [2022-02-20 20:00:07,816 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12393#false} {12392#true} #1889#return; {12393#false} is VALID [2022-02-20 20:00:07,816 INFO L272 TraceCheckUtils]: 39: Hoare triple {12393#false} call reset_delta_events1(); {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {12393#false} assume !(1bv32 == ~q_read_ev~0); {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#false} assume !(1bv32 == ~q_write_ev~0); {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#false} assume true; {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12393#false} {12393#false} #1891#return; {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {12393#false} assume !false; {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {12393#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {12393#false} is VALID [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {12393#false} assume !false; {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L272 TraceCheckUtils]: 47: Hoare triple {12393#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {12393#false} havoc ~__retres1~2; {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {12393#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {12393#false} #res := ~__retres1~2; {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {12393#false} assume true; {12393#false} is VALID [2022-02-20 20:00:07,818 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12393#false} {12393#false} #1893#return; {12393#false} is VALID [2022-02-20 20:00:07,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {12393#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {12393#false} is VALID [2022-02-20 20:00:07,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {12393#false} assume 0bv32 != eval1_~tmp___1~0#1; {12393#false} is VALID [2022-02-20 20:00:07,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {12393#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {12393#false} is VALID [2022-02-20 20:00:07,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {12393#false} assume !(0bv32 != eval1_~tmp~2#1); {12393#false} is VALID [2022-02-20 20:00:07,819 INFO L272 TraceCheckUtils]: 57: Hoare triple {12393#false} call error1(); {12393#false} is VALID [2022-02-20 20:00:07,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {12393#false} assume !false; {12393#false} is VALID [2022-02-20 20:00:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:07,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:07,821 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:07,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091430468] [2022-02-20 20:00:07,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091430468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:07,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:07,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:07,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47848012] [2022-02-20 20:00:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:07,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:07,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:07,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:07,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:07,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:07,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:07,867 INFO L87 Difference]: Start difference. First operand 785 states and 1148 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,403 INFO L93 Difference]: Finished difference Result 1180 states and 1679 transitions. [2022-02-20 20:00:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2022-02-20 20:00:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2022-02-20 20:00:09,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 857 transitions. [2022-02-20 20:00:09,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 857 edges. 857 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:09,994 INFO L225 Difference]: With dead ends: 1180 [2022-02-20 20:00:09,994 INFO L226 Difference]: Without dead ends: 799 [2022-02-20 20:00:09,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:09,996 INFO L933 BasicCegarLoop]: 725 mSDtfsCounter, 4 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:09,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3620 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 20:00:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-02-20 20:00:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 795. [2022-02-20 20:00:10,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:10,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) [2022-02-20 20:00:10,015 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) [2022-02-20 20:00:10,016 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) [2022-02-20 20:00:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:10,039 INFO L93 Difference]: Finished difference Result 799 states and 1162 transitions. [2022-02-20 20:00:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1162 transitions. [2022-02-20 20:00:10,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:10,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:10,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) Second operand 799 states. [2022-02-20 20:00:10,043 INFO L87 Difference]: Start difference. First operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) Second operand 799 states. [2022-02-20 20:00:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:10,068 INFO L93 Difference]: Finished difference Result 799 states and 1162 transitions. [2022-02-20 20:00:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1162 transitions. [2022-02-20 20:00:10,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:10,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:10,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:10,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 671 states have (on average 1.4634873323397914) internal successors, (982), 686 states have internal predecessors, (982), 74 states have call successors, (74), 35 states have call predecessors, (74), 48 states have return successors, (100), 78 states have call predecessors, (100), 71 states have call successors, (100) [2022-02-20 20:00:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1156 transitions. [2022-02-20 20:00:10,101 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1156 transitions. Word has length 59 [2022-02-20 20:00:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:10,102 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1156 transitions. [2022-02-20 20:00:10,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1156 transitions. [2022-02-20 20:00:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:10,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:10,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:10,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 20:00:10,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 20:00:10,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1997522754, now seen corresponding path program 1 times [2022-02-20 20:00:10,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:10,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160547989] [2022-02-20 20:00:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:10,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 20:00:10,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 20:00:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:00:10,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:00:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:00:10,603 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 20:00:10,604 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:00:10,604 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:00:10,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:00:10,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 20:00:10,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 20:00:10,817 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 20:00:10,820 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:00:10,877 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 20:00:10,878 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 20:00:10,880 INFO L158 Benchmark]: Toolchain (without parser) took 16398.08ms. Allocated memory was 54.5MB in the beginning and 205.5MB in the end (delta: 151.0MB). Free memory was 32.4MB in the beginning and 138.9MB in the end (delta: -106.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,880 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:00:10,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.61ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 32.2MB in the beginning and 41.6MB in the end (delta: -9.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.43ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 36.0MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,882 INFO L158 Benchmark]: Boogie Preprocessor took 90.68ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 49.7MB in the end (delta: -13.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,883 INFO L158 Benchmark]: RCFGBuilder took 953.22ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 34.1MB in the end (delta: 15.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,883 INFO L158 Benchmark]: TraceAbstraction took 14836.82ms. Allocated memory was 71.3MB in the beginning and 205.5MB in the end (delta: 134.2MB). Free memory was 33.4MB in the beginning and 138.9MB in the end (delta: -105.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2022-02-20 20:00:10,884 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.61ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 32.2MB in the beginning and 41.6MB in the end (delta: -9.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.43ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 36.0MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.68ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 49.7MB in the end (delta: -13.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * RCFGBuilder took 953.22ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 34.1MB in the end (delta: 15.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14836.82ms. Allocated memory was 71.3MB in the beginning and 205.5MB in the end (delta: 134.2MB). Free memory was 33.4MB in the beginning and 138.9MB in the end (delta: -105.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 20:00:10,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator