./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.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-1+token_ring.11.cil-1.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 ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:54,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:54,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:54,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:54,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:54,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:54,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:54,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:54,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:54,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:54,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:54,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:54,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:54,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:54,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:54,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:54,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:54,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:54,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:54,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:54,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:54,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:54,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:54,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:54,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:54,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:54,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:54,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:54,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:54,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:54,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:54,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:54,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:54,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:54,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:54,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:54,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:54,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:54,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:54,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:54,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:54,474 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:57:54,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:54,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:54,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:54,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:54,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:54,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:54,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:54,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:54,491 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:54,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:54,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:54,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:54,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:54,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:54,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:54,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:54,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:54,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:54,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:54,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:54,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:54,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:54,494 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 -> ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 [2022-02-20 19:57:54,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:54,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:54,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:54,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:54,696 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:54,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2022-02-20 19:57:54,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065d0dffa/c9f2a1f3006c4bb19298946aa7035b83/FLAGbcb0319b0 [2022-02-20 19:57:55,099 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:55,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2022-02-20 19:57:55,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065d0dffa/c9f2a1f3006c4bb19298946aa7035b83/FLAGbcb0319b0 [2022-02-20 19:57:55,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065d0dffa/c9f2a1f3006c4bb19298946aa7035b83 [2022-02-20 19:57:55,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:55,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:55,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:55,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:55,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:55,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5be297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55, skipping insertion in model container [2022-02-20 19:57:55,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:55,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:55,324 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-1+token_ring.11.cil-1.c[914,927] [2022-02-20 19:57:55,358 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-1+token_ring.11.cil-1.c[7115,7128] [2022-02-20 19:57:55,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:55,425 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:55,432 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-1+token_ring.11.cil-1.c[914,927] [2022-02-20 19:57:55,444 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-1+token_ring.11.cil-1.c[7115,7128] [2022-02-20 19:57:55,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:55,531 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:55,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55 WrapperNode [2022-02-20 19:57:55,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:55,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:55,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:55,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:55,542 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:57:55" (1/1) ... [2022-02-20 19:57:55,564 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:57:55" (1/1) ... [2022-02-20 19:57:55,627 INFO L137 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 987 [2022-02-20 19:57:55,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:55,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:55,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:55,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:55,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:55,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:55,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:55,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:55,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (1/1) ... [2022-02-20 19:57:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:55,730 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:57:55,734 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:57:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:55,757 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:55,757 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:55,860 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:55,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:56,582 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:56,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:56,592 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 19:57:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:56 BoogieIcfgContainer [2022-02-20 19:57:56,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:56,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:56,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:56,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:56,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:55" (1/3) ... [2022-02-20 19:57:56,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3724efb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:56, skipping insertion in model container [2022-02-20 19:57:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:55" (2/3) ... [2022-02-20 19:57:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3724efb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:56, skipping insertion in model container [2022-02-20 19:57:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:56" (3/3) ... [2022-02-20 19:57:56,599 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2022-02-20 19:57:56,602 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:56,602 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:56,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:56,639 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:57:56,640 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 407 states have (on average 1.6412776412776413) internal successors, (668), 415 states have internal predecessors, (668), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 19:57:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:56,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:56,671 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:56,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -332342255, now seen corresponding path program 1 times [2022-02-20 19:57:56,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:56,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706486216] [2022-02-20 19:57:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {509#(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); {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {471#(= ~q_read_ev~0 2)} #1801#return; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#(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; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:56,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:56,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#(= |old(~q_read_ev~0)| 0)} assume true; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:56,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#(= |old(~q_read_ev~0)| 0)} {471#(= ~q_read_ev~0 2)} #1803#return; {470#false} is VALID [2022-02-20 19:57:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#true} havoc ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume 1 == ~p_dw_pc~0; {469#true} is VALID [2022-02-20 19:57:57,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {469#true} is VALID [2022-02-20 19:57:57,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#true} #res := ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,005 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {469#true} {469#true} #1797#return; {469#true} is VALID [2022-02-20 19:57:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#true} havoc ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume 1 == ~c_dr_pc~0; {469#true} is VALID [2022-02-20 19:57:57,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {469#true} is VALID [2022-02-20 19:57:57,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#true} #res := ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,015 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {469#true} {469#true} #1799#return; {469#true} is VALID [2022-02-20 19:57:57,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#(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; {469#true} is VALID [2022-02-20 19:57:57,015 INFO L272 TraceCheckUtils]: 1: Hoare triple {469#true} call #t~ret8 := is_do_write_p_triggered(); {469#true} is VALID [2022-02-20 19:57:57,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} havoc ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#true} assume 1 == ~p_dw_pc~0; {469#true} is VALID [2022-02-20 19:57:57,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {469#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {469#true} is VALID [2022-02-20 19:57:57,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} #res := ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,018 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {469#true} {469#true} #1797#return; {469#true} is VALID [2022-02-20 19:57:57,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {469#true} is VALID [2022-02-20 19:57:57,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {469#true} is VALID [2022-02-20 19:57:57,018 INFO L272 TraceCheckUtils]: 10: Hoare triple {469#true} call #t~ret9 := is_do_read_c_triggered(); {469#true} is VALID [2022-02-20 19:57:57,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#true} havoc ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} assume 1 == ~c_dr_pc~0; {469#true} is VALID [2022-02-20 19:57:57,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {469#true} is VALID [2022-02-20 19:57:57,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} #res := ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,020 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {469#true} {469#true} #1799#return; {469#true} is VALID [2022-02-20 19:57:57,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {469#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {469#true} is VALID [2022-02-20 19:57:57,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {469#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {469#true} is VALID [2022-02-20 19:57:57,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,023 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {469#true} {470#false} #1805#return; {470#false} is VALID [2022-02-20 19:57:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#(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;~q_read_ev~0 := 2; {469#true} is VALID [2022-02-20 19:57:57,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {469#true} is VALID [2022-02-20 19:57:57,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {470#false} #1807#return; {470#false} is VALID [2022-02-20 19:57:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#true} havoc ~__retres1~2; {469#true} is VALID [2022-02-20 19:57:57,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {469#true} is VALID [2022-02-20 19:57:57,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} #res := ~__retres1~2; {469#true} is VALID [2022-02-20 19:57:57,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,037 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {469#true} {470#false} #1809#return; {470#false} is VALID [2022-02-20 19:57:57,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {469#true} is VALID [2022-02-20 19:57:57,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {469#true} is VALID [2022-02-20 19:57:57,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(= ~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; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#(= ~q_read_ev~0 2)} call update_channels1(); {509#(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:57:57,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(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); {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:57,046 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {510#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {471#(= ~q_read_ev~0 2)} #1801#return; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {471#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:57,048 INFO L272 TraceCheckUtils]: 12: Hoare triple {471#(= ~q_read_ev~0 2)} call fire_delta_events1(); {511#(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:57:57,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#(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; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:57,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:57,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#(= |old(~q_read_ev~0)| 0)} assume true; {512#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:57,050 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {512#(= |old(~q_read_ev~0)| 0)} {471#(= ~q_read_ev~0 2)} #1803#return; {470#false} is VALID [2022-02-20 19:57:57,051 INFO L272 TraceCheckUtils]: 17: Hoare triple {470#false} call activate_threads1(); {513#(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:57:57,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#(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; {469#true} is VALID [2022-02-20 19:57:57,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {469#true} call #t~ret8 := is_do_write_p_triggered(); {469#true} is VALID [2022-02-20 19:57:57,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {469#true} havoc ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {469#true} assume 1 == ~p_dw_pc~0; {469#true} is VALID [2022-02-20 19:57:57,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {469#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {469#true} is VALID [2022-02-20 19:57:57,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {469#true} #res := ~__retres1~0; {469#true} is VALID [2022-02-20 19:57:57,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,052 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {469#true} {469#true} #1797#return; {469#true} is VALID [2022-02-20 19:57:57,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {469#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {469#true} is VALID [2022-02-20 19:57:57,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {469#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {469#true} is VALID [2022-02-20 19:57:57,053 INFO L272 TraceCheckUtils]: 28: Hoare triple {469#true} call #t~ret9 := is_do_read_c_triggered(); {469#true} is VALID [2022-02-20 19:57:57,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {469#true} havoc ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {469#true} assume 1 == ~c_dr_pc~0; {469#true} is VALID [2022-02-20 19:57:57,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {469#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {469#true} is VALID [2022-02-20 19:57:57,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {469#true} #res := ~__retres1~1; {469#true} is VALID [2022-02-20 19:57:57,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,054 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {469#true} {469#true} #1799#return; {469#true} is VALID [2022-02-20 19:57:57,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {469#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {469#true} is VALID [2022-02-20 19:57:57,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {469#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {469#true} is VALID [2022-02-20 19:57:57,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,055 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {469#true} {470#false} #1805#return; {470#false} is VALID [2022-02-20 19:57:57,055 INFO L272 TraceCheckUtils]: 39: Hoare triple {470#false} call reset_delta_events1(); {511#(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:57:57,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {511#(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;~q_read_ev~0 := 2; {469#true} is VALID [2022-02-20 19:57:57,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {469#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {469#true} is VALID [2022-02-20 19:57:57,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,056 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {469#true} {470#false} #1807#return; {470#false} is VALID [2022-02-20 19:57:57,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-02-20 19:57:57,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {470#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; {470#false} is VALID [2022-02-20 19:57:57,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-02-20 19:57:57,057 INFO L272 TraceCheckUtils]: 47: Hoare triple {470#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {469#true} is VALID [2022-02-20 19:57:57,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {469#true} havoc ~__retres1~2; {469#true} is VALID [2022-02-20 19:57:57,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {469#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {469#true} is VALID [2022-02-20 19:57:57,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {469#true} #res := ~__retres1~2; {469#true} is VALID [2022-02-20 19:57:57,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {469#true} assume true; {469#true} is VALID [2022-02-20 19:57:57,060 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {469#true} {470#false} #1809#return; {470#false} is VALID [2022-02-20 19:57:57,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {470#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; {470#false} is VALID [2022-02-20 19:57:57,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {470#false} assume 0 != eval1_~tmp___1~0#1; {470#false} is VALID [2022-02-20 19:57:57,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {470#false} assume !(0 == ~p_dw_st~0); {470#false} is VALID [2022-02-20 19:57:57,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {470#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {470#false} is VALID [2022-02-20 19:57:57,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {470#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {470#false} is VALID [2022-02-20 19:57:57,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {470#false} assume 0 == ~c_dr_pc~0; {470#false} is VALID [2022-02-20 19:57:57,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-02-20 19:57:57,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {470#false} assume !(1 == ~q_free~0); {470#false} is VALID [2022-02-20 19:57:57,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {470#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {470#false} is VALID [2022-02-20 19:57:57,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {470#false} assume !(~p_last_write~0 == ~c_last_read~0); {470#false} is VALID [2022-02-20 19:57:57,066 INFO L272 TraceCheckUtils]: 63: Hoare triple {470#false} call error1(); {470#false} is VALID [2022-02-20 19:57:57,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-02-20 19:57:57,067 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:57:57,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:57,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706486216] [2022-02-20 19:57:57,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706486216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:57,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:57,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:57,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805737769] [2022-02-20 19:57:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:57,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:57,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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:57:57,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:57,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:57,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:57,163 INFO L87 Difference]: Start difference. First operand has 466 states, 407 states have (on average 1.6412776412776413) internal successors, (668), 415 states have internal predecessors, (668), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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:58:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,258 INFO L93 Difference]: Finished difference Result 1039 states and 1660 transitions. [2022-02-20 19:58:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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:58:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1660 transitions. [2022-02-20 19:58:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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:58:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1660 transitions. [2022-02-20 19:58:00,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1660 transitions. [2022-02-20 19:58:01,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1660 edges. 1660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:01,348 INFO L225 Difference]: With dead ends: 1039 [2022-02-20 19:58:01,349 INFO L226 Difference]: Without dead ends: 590 [2022-02-20 19:58:01,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:01,355 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 1158 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:01,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 2372 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-02-20 19:58:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 551. [2022-02-20 19:58:01,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:01,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 590 states. Second operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:01,404 INFO L74 IsIncluded]: Start isIncluded. First operand 590 states. Second operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:01,405 INFO L87 Difference]: Start difference. First operand 590 states. Second operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,427 INFO L93 Difference]: Finished difference Result 590 states and 884 transitions. [2022-02-20 19:58:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 884 transitions. [2022-02-20 19:58:01,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 590 states. [2022-02-20 19:58:01,434 INFO L87 Difference]: Start difference. First operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 590 states. [2022-02-20 19:58:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,454 INFO L93 Difference]: Finished difference Result 590 states and 884 transitions. [2022-02-20 19:58:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 884 transitions. [2022-02-20 19:58:01,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:01,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 482 states have internal predecessors, (725), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 830 transitions. [2022-02-20 19:58:01,478 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 830 transitions. Word has length 65 [2022-02-20 19:58:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:01,479 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 830 transitions. [2022-02-20 19:58:01,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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:58:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 830 transitions. [2022-02-20 19:58:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:01,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:01,481 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:01,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:01,481 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 71443696, now seen corresponding path program 1 times [2022-02-20 19:58:01,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:01,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812453151] [2022-02-20 19:58:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {3865#(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); {3866#(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:58:01,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3866#(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:58:01,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3866#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3827#(= ~q_write_ev~0 ~q_read_ev~0)} #1801#return; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(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); {3867#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3867#(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; {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3827#(= ~q_write_ev~0 ~q_read_ev~0)} #1803#return; {3826#false} is VALID [2022-02-20 19:58:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {3825#true} havoc ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume !(1 == ~p_dw_pc~0); {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} ~__retres1~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {3825#true} #res := ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3825#true} {3825#true} #1797#return; {3825#true} is VALID [2022-02-20 19:58:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {3825#true} havoc ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume 1 == ~c_dr_pc~0; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {3825#true} #res := ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3825#true} {3825#true} #1799#return; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#(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; {3825#true} is VALID [2022-02-20 19:58:01,578 INFO L272 TraceCheckUtils]: 1: Hoare triple {3825#true} call #t~ret8 := is_do_write_p_triggered(); {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} havoc ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {3825#true} assume !(1 == ~p_dw_pc~0); {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {3825#true} ~__retres1~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {3825#true} #res := ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,579 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3825#true} {3825#true} #1797#return; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3825#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3825#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L272 TraceCheckUtils]: 10: Hoare triple {3825#true} call #t~ret9 := is_do_read_c_triggered(); {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {3825#true} havoc ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {3825#true} assume 1 == ~c_dr_pc~0; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {3825#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3825#true} is VALID [2022-02-20 19:58:01,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3825#true} #res := ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3825#true} {3825#true} #1799#return; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {3825#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {3825#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,581 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3825#true} {3826#false} #1805#return; {3826#false} is VALID [2022-02-20 19:58:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(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); {3825#true} is VALID [2022-02-20 19:58:01,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3825#true} is VALID [2022-02-20 19:58:01,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3825#true} {3826#false} #1807#return; {3826#false} is VALID [2022-02-20 19:58:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {3825#true} havoc ~__retres1~2; {3825#true} is VALID [2022-02-20 19:58:01,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3825#true} is VALID [2022-02-20 19:58:01,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} #res := ~__retres1~2; {3825#true} is VALID [2022-02-20 19:58:01,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,590 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3825#true} {3826#false} #1809#return; {3826#false} is VALID [2022-02-20 19:58:01,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {3825#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {3825#true} is VALID [2022-02-20 19:58:01,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {3827#(= ~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; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3865#(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:58:01,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {3865#(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); {3866#(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:58:01,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {3866#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3866#(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:58:01,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3866#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3827#(= ~q_write_ev~0 ~q_read_ev~0)} #1801#return; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3827#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,595 INFO L272 TraceCheckUtils]: 12: Hoare triple {3827#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3866#(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:58:01,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {3866#(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); {3867#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {3867#(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; {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3868#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3827#(= ~q_write_ev~0 ~q_read_ev~0)} #1803#return; {3826#false} is VALID [2022-02-20 19:58:01,597 INFO L272 TraceCheckUtils]: 17: Hoare triple {3826#false} call activate_threads1(); {3869#(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:58:01,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#(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; {3825#true} is VALID [2022-02-20 19:58:01,597 INFO L272 TraceCheckUtils]: 19: Hoare triple {3825#true} call #t~ret8 := is_do_write_p_triggered(); {3825#true} is VALID [2022-02-20 19:58:01,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {3825#true} havoc ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {3825#true} assume !(1 == ~p_dw_pc~0); {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {3825#true} ~__retres1~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {3825#true} #res := ~__retres1~0; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3825#true} {3825#true} #1797#return; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {3825#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3825#true} is VALID [2022-02-20 19:58:01,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {3825#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L272 TraceCheckUtils]: 28: Hoare triple {3825#true} call #t~ret9 := is_do_read_c_triggered(); {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {3825#true} havoc ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {3825#true} assume 1 == ~c_dr_pc~0; {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {3825#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {3825#true} #res := ~__retres1~1; {3825#true} is VALID [2022-02-20 19:58:01,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,600 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3825#true} {3825#true} #1799#return; {3825#true} is VALID [2022-02-20 19:58:01,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {3825#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3825#true} is VALID [2022-02-20 19:58:01,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {3825#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3825#true} is VALID [2022-02-20 19:58:01,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,600 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3825#true} {3826#false} #1805#return; {3826#false} is VALID [2022-02-20 19:58:01,600 INFO L272 TraceCheckUtils]: 39: Hoare triple {3826#false} call reset_delta_events1(); {3866#(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:58:01,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {3866#(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); {3825#true} is VALID [2022-02-20 19:58:01,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {3825#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3825#true} is VALID [2022-02-20 19:58:01,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,601 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3825#true} {3826#false} #1807#return; {3826#false} is VALID [2022-02-20 19:58:01,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {3826#false} assume !false; {3826#false} is VALID [2022-02-20 19:58:01,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {3826#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; {3826#false} is VALID [2022-02-20 19:58:01,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {3826#false} assume !false; {3826#false} is VALID [2022-02-20 19:58:01,602 INFO L272 TraceCheckUtils]: 47: Hoare triple {3826#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3825#true} is VALID [2022-02-20 19:58:01,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {3825#true} havoc ~__retres1~2; {3825#true} is VALID [2022-02-20 19:58:01,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {3825#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3825#true} is VALID [2022-02-20 19:58:01,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {3825#true} #res := ~__retres1~2; {3825#true} is VALID [2022-02-20 19:58:01,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-02-20 19:58:01,602 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3825#true} {3826#false} #1809#return; {3826#false} is VALID [2022-02-20 19:58:01,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {3826#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; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {3826#false} assume 0 != eval1_~tmp___1~0#1; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {3826#false} assume !(0 == ~p_dw_st~0); {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {3826#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {3826#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {3826#false} assume 0 == ~c_dr_pc~0; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {3826#false} assume !false; {3826#false} is VALID [2022-02-20 19:58:01,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {3826#false} assume !(1 == ~q_free~0); {3826#false} is VALID [2022-02-20 19:58:01,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {3826#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {3826#false} is VALID [2022-02-20 19:58:01,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {3826#false} assume !(~p_last_write~0 == ~c_last_read~0); {3826#false} is VALID [2022-02-20 19:58:01,604 INFO L272 TraceCheckUtils]: 63: Hoare triple {3826#false} call error1(); {3826#false} is VALID [2022-02-20 19:58:01,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {3826#false} assume !false; {3826#false} is VALID [2022-02-20 19:58:01,604 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:58:01,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:01,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812453151] [2022-02-20 19:58:01,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812453151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:01,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:01,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:01,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294329674] [2022-02-20 19:58:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:01,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:01,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:01,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:01,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:01,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:01,646 INFO L87 Difference]: Start difference. First operand 551 states and 830 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,046 INFO L93 Difference]: Finished difference Result 898 states and 1307 transitions. [2022-02-20 19:58:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1036 transitions. [2022-02-20 19:58:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1036 transitions. [2022-02-20 19:58:05,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1036 transitions. [2022-02-20 19:58:05,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1036 edges. 1036 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:05,847 INFO L225 Difference]: With dead ends: 898 [2022-02-20 19:58:05,847 INFO L226 Difference]: Without dead ends: 721 [2022-02-20 19:58:05,851 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:58:05,853 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 1761 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:05,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1791 Valid, 2246 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-02-20 19:58:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 647. [2022-02-20 19:58:05,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:05,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:05,896 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:05,897 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,920 INFO L93 Difference]: Finished difference Result 721 states and 1067 transitions. [2022-02-20 19:58:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1067 transitions. [2022-02-20 19:58:05,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:05,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:05,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 721 states. [2022-02-20 19:58:05,926 INFO L87 Difference]: Start difference. First operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 721 states. [2022-02-20 19:58:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,949 INFO L93 Difference]: Finished difference Result 721 states and 1067 transitions. [2022-02-20 19:58:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1067 transitions. [2022-02-20 19:58:05,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:05,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:05,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:05,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 551 states have (on average 1.5045372050816697) internal successors, (829), 560 states have internal predecessors, (829), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 964 transitions. [2022-02-20 19:58:05,975 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 964 transitions. Word has length 65 [2022-02-20 19:58:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:05,977 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 964 transitions. [2022-02-20 19:58:05,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 964 transitions. [2022-02-20 19:58:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:05,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:05,980 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:05,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:05,981 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1957142414, now seen corresponding path program 1 times [2022-02-20 19:58:05,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:05,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639917548] [2022-02-20 19:58:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {7443#(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); {7404#true} is VALID [2022-02-20 19:58:06,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7404#true} {7404#true} #1801#return; {7404#true} is VALID [2022-02-20 19:58:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {7444#(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); {7404#true} is VALID [2022-02-20 19:58:06,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume !(0 == ~q_write_ev~0); {7404#true} is VALID [2022-02-20 19:58:06,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7404#true} {7404#true} #1803#return; {7404#true} is VALID [2022-02-20 19:58:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {7404#true} havoc ~__retres1~0; {7404#true} is VALID [2022-02-20 19:58:06,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume !(1 == ~p_dw_pc~0); {7404#true} is VALID [2022-02-20 19:58:06,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} ~__retres1~0 := 0; {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:06,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,128 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7404#true} #1797#return; {7452#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {7404#true} havoc ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume 1 == ~c_dr_pc~0; {7404#true} is VALID [2022-02-20 19:58:06,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7404#true} is VALID [2022-02-20 19:58:06,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {7404#true} #res := ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,132 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7404#true} {7405#false} #1799#return; {7405#false} is VALID [2022-02-20 19:58:06,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {7445#(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; {7404#true} is VALID [2022-02-20 19:58:06,133 INFO L272 TraceCheckUtils]: 1: Hoare triple {7404#true} call #t~ret8 := is_do_write_p_triggered(); {7404#true} is VALID [2022-02-20 19:58:06,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} havoc ~__retres1~0; {7404#true} is VALID [2022-02-20 19:58:06,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {7404#true} assume !(1 == ~p_dw_pc~0); {7404#true} is VALID [2022-02-20 19:58:06,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {7404#true} ~__retres1~0 := 0; {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:06,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,135 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7404#true} #1797#return; {7452#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:06,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {7452#(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; {7453#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:06,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {7453#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7405#false} is VALID [2022-02-20 19:58:06,136 INFO L272 TraceCheckUtils]: 10: Hoare triple {7405#false} call #t~ret9 := is_do_read_c_triggered(); {7404#true} is VALID [2022-02-20 19:58:06,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {7404#true} havoc ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {7404#true} assume 1 == ~c_dr_pc~0; {7404#true} is VALID [2022-02-20 19:58:06,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7404#true} is VALID [2022-02-20 19:58:06,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {7404#true} #res := ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,137 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7404#true} {7405#false} #1799#return; {7405#false} is VALID [2022-02-20 19:58:06,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {7405#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7405#false} is VALID [2022-02-20 19:58:06,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {7405#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7405#false} is VALID [2022-02-20 19:58:06,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {7405#false} assume true; {7405#false} is VALID [2022-02-20 19:58:06,137 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7405#false} {7404#true} #1805#return; {7405#false} is VALID [2022-02-20 19:58:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {7444#(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); {7404#true} is VALID [2022-02-20 19:58:06,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7404#true} is VALID [2022-02-20 19:58:06,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7404#true} {7405#false} #1807#return; {7405#false} is VALID [2022-02-20 19:58:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {7404#true} havoc ~__retres1~2; {7404#true} is VALID [2022-02-20 19:58:06,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7404#true} is VALID [2022-02-20 19:58:06,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} #res := ~__retres1~2; {7404#true} is VALID [2022-02-20 19:58:06,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,145 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7404#true} {7405#false} #1809#return; {7405#false} is VALID [2022-02-20 19:58:06,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {7404#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {7404#true} is VALID [2022-02-20 19:58:06,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {7404#true} is VALID [2022-02-20 19:58:06,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {7404#true} is VALID [2022-02-20 19:58:06,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {7404#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; {7404#true} is VALID [2022-02-20 19:58:06,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {7404#true} call update_channels1(); {7443#(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:58:06,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#(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); {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7404#true} {7404#true} #1801#return; {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {7404#true} assume { :begin_inline_init_threads1 } true; {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {7404#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {7404#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7404#true} is VALID [2022-02-20 19:58:06,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {7404#true} assume { :end_inline_init_threads1 } true; {7404#true} is VALID [2022-02-20 19:58:06,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {7404#true} call fire_delta_events1(); {7444#(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:58:06,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {7444#(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); {7404#true} is VALID [2022-02-20 19:58:06,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {7404#true} assume !(0 == ~q_write_ev~0); {7404#true} is VALID [2022-02-20 19:58:06,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,148 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7404#true} {7404#true} #1803#return; {7404#true} is VALID [2022-02-20 19:58:06,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {7404#true} call activate_threads1(); {7445#(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:58:06,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {7445#(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; {7404#true} is VALID [2022-02-20 19:58:06,149 INFO L272 TraceCheckUtils]: 19: Hoare triple {7404#true} call #t~ret8 := is_do_write_p_triggered(); {7404#true} is VALID [2022-02-20 19:58:06,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {7404#true} havoc ~__retres1~0; {7404#true} is VALID [2022-02-20 19:58:06,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {7404#true} assume !(1 == ~p_dw_pc~0); {7404#true} is VALID [2022-02-20 19:58:06,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {7404#true} ~__retres1~0 := 0; {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:06,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {7460#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:06,151 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7461#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7404#true} #1797#return; {7452#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:06,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {7452#(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; {7453#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:06,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {7453#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7405#false} is VALID [2022-02-20 19:58:06,152 INFO L272 TraceCheckUtils]: 28: Hoare triple {7405#false} call #t~ret9 := is_do_read_c_triggered(); {7404#true} is VALID [2022-02-20 19:58:06,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {7404#true} havoc ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {7404#true} assume 1 == ~c_dr_pc~0; {7404#true} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {7404#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7404#true} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {7404#true} #res := ~__retres1~1; {7404#true} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,153 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7404#true} {7405#false} #1799#return; {7405#false} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {7405#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7405#false} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {7405#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7405#false} is VALID [2022-02-20 19:58:06,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {7405#false} assume true; {7405#false} is VALID [2022-02-20 19:58:06,154 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7405#false} {7404#true} #1805#return; {7405#false} is VALID [2022-02-20 19:58:06,154 INFO L272 TraceCheckUtils]: 39: Hoare triple {7405#false} call reset_delta_events1(); {7444#(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:58:06,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {7444#(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); {7404#true} is VALID [2022-02-20 19:58:06,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {7404#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7404#true} is VALID [2022-02-20 19:58:06,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,154 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7404#true} {7405#false} #1807#return; {7405#false} is VALID [2022-02-20 19:58:06,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {7405#false} assume !false; {7405#false} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {7405#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; {7405#false} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {7405#false} assume !false; {7405#false} is VALID [2022-02-20 19:58:06,155 INFO L272 TraceCheckUtils]: 47: Hoare triple {7405#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7404#true} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {7404#true} havoc ~__retres1~2; {7404#true} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {7404#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7404#true} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {7404#true} #res := ~__retres1~2; {7404#true} is VALID [2022-02-20 19:58:06,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-02-20 19:58:06,156 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7404#true} {7405#false} #1809#return; {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {7405#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; {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {7405#false} assume 0 != eval1_~tmp___1~0#1; {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {7405#false} assume !(0 == ~p_dw_st~0); {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {7405#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {7405#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {7405#false} is VALID [2022-02-20 19:58:06,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {7405#false} assume 0 == ~c_dr_pc~0; {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {7405#false} assume !false; {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {7405#false} assume !(1 == ~q_free~0); {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {7405#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {7405#false} assume !(~p_last_write~0 == ~c_last_read~0); {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L272 TraceCheckUtils]: 63: Hoare triple {7405#false} call error1(); {7405#false} is VALID [2022-02-20 19:58:06,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {7405#false} assume !false; {7405#false} is VALID [2022-02-20 19:58:06,158 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:58:06,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:06,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639917548] [2022-02-20 19:58:06,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639917548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:06,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:06,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:06,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307355552] [2022-02-20 19:58:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:06,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:06,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:06,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:06,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:06,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:06,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:06,198 INFO L87 Difference]: Start difference. First operand 647 states and 964 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,678 INFO L93 Difference]: Finished difference Result 948 states and 1378 transitions. [2022-02-20 19:58:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:09,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 854 transitions. [2022-02-20 19:58:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 854 transitions. [2022-02-20 19:58:09,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 854 transitions. [2022-02-20 19:58:10,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 854 edges. 854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,261 INFO L225 Difference]: With dead ends: 948 [2022-02-20 19:58:10,262 INFO L226 Difference]: Without dead ends: 681 [2022-02-20 19:58:10,262 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:58:10,263 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 612 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 3059 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:10,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 3059 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-02-20 19:58:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 652. [2022-02-20 19:58:10,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:10,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:10,286 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:10,287 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,306 INFO L93 Difference]: Finished difference Result 681 states and 1008 transitions. [2022-02-20 19:58:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1008 transitions. [2022-02-20 19:58:10,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 681 states. [2022-02-20 19:58:10,310 INFO L87 Difference]: Start difference. First operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 681 states. [2022-02-20 19:58:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,329 INFO L93 Difference]: Finished difference Result 681 states and 1008 transitions. [2022-02-20 19:58:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1008 transitions. [2022-02-20 19:58:10,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:10,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 555 states have (on average 1.4972972972972973) internal successors, (831), 564 states have internal predecessors, (831), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 967 transitions. [2022-02-20 19:58:10,353 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 967 transitions. Word has length 65 [2022-02-20 19:58:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:10,353 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 967 transitions. [2022-02-20 19:58:10,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 967 transitions. [2022-02-20 19:58:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:10,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:10,354 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:10,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:10,355 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1308465584, now seen corresponding path program 1 times [2022-02-20 19:58:10,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:10,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030625726] [2022-02-20 19:58:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {11010#(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); {11011#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:10,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {11011#(not (= |old(~q_req_up~0)| 1))} assume true; {11011#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:10,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11011#(not (= |old(~q_req_up~0)| 1))} {10971#(= ~c_dr_pc~0 ~q_req_up~0)} #1801#return; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {11012#(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); {10968#true} is VALID [2022-02-20 19:58:10,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {10968#true} assume !(0 == ~q_write_ev~0); {10968#true} is VALID [2022-02-20 19:58:10,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10968#true} {10975#(not (= ~c_dr_pc~0 1))} #1803#return; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {10968#true} havoc ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {10968#true} assume !(1 == ~p_dw_pc~0); {10968#true} is VALID [2022-02-20 19:58:10,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {10968#true} ~__retres1~0 := 0; {10968#true} is VALID [2022-02-20 19:58:10,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {10968#true} #res := ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,454 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10968#true} {10968#true} #1797#return; {10968#true} is VALID [2022-02-20 19:58:10,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {10968#true} havoc ~__retres1~1; {10968#true} is VALID [2022-02-20 19:58:10,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {10968#true} assume 1 == ~c_dr_pc~0; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,462 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} {10968#true} #1799#return; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {11013#(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; {10968#true} is VALID [2022-02-20 19:58:10,463 INFO L272 TraceCheckUtils]: 1: Hoare triple {10968#true} call #t~ret8 := is_do_write_p_triggered(); {10968#true} is VALID [2022-02-20 19:58:10,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {10968#true} havoc ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {10968#true} assume !(1 == ~p_dw_pc~0); {10968#true} is VALID [2022-02-20 19:58:10,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {10968#true} ~__retres1~0 := 0; {10968#true} is VALID [2022-02-20 19:58:10,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {10968#true} #res := ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,464 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10968#true} {10968#true} #1797#return; {10968#true} is VALID [2022-02-20 19:58:10,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {10968#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10968#true} is VALID [2022-02-20 19:58:10,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {10968#true} assume !(0 != ~tmp~1); {10968#true} is VALID [2022-02-20 19:58:10,464 INFO L272 TraceCheckUtils]: 10: Hoare triple {10968#true} call #t~ret9 := is_do_read_c_triggered(); {10968#true} is VALID [2022-02-20 19:58:10,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {10968#true} havoc ~__retres1~1; {10968#true} is VALID [2022-02-20 19:58:10,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {10968#true} assume 1 == ~c_dr_pc~0; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,471 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} {10968#true} #1799#return; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,474 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} {10975#(not (= ~c_dr_pc~0 1))} #1805#return; {10969#false} is VALID [2022-02-20 19:58:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {11012#(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); {10968#true} is VALID [2022-02-20 19:58:10,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {10968#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10968#true} is VALID [2022-02-20 19:58:10,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10968#true} {10969#false} #1807#return; {10969#false} is VALID [2022-02-20 19:58:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {10968#true} havoc ~__retres1~2; {10968#true} is VALID [2022-02-20 19:58:10,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {10968#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10968#true} is VALID [2022-02-20 19:58:10,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {10968#true} #res := ~__retres1~2; {10968#true} is VALID [2022-02-20 19:58:10,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,489 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10968#true} {10969#false} #1809#return; {10969#false} is VALID [2022-02-20 19:58:10,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {10968#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {10970#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:10,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {10970#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {10970#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:10,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {10970#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {10971#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:10,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {10971#(= ~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; {10971#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:10,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {10971#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {11010#(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:58:10,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {11010#(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); {11011#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:10,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {11011#(not (= |old(~q_req_up~0)| 1))} assume true; {11011#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:10,496 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11011#(not (= |old(~q_req_up~0)| 1))} {10971#(= ~c_dr_pc~0 ~q_req_up~0)} #1801#return; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {11012#(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:58:10,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {11012#(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); {10968#true} is VALID [2022-02-20 19:58:10,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {10968#true} assume !(0 == ~q_write_ev~0); {10968#true} is VALID [2022-02-20 19:58:10,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,498 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10968#true} {10975#(not (= ~c_dr_pc~0 1))} #1803#return; {10975#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:10,499 INFO L272 TraceCheckUtils]: 17: Hoare triple {10975#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {11013#(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:58:10,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {11013#(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; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L272 TraceCheckUtils]: 19: Hoare triple {10968#true} call #t~ret8 := is_do_write_p_triggered(); {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {10968#true} havoc ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {10968#true} assume !(1 == ~p_dw_pc~0); {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {10968#true} ~__retres1~0 := 0; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {10968#true} #res := ~__retres1~0; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10968#true} {10968#true} #1797#return; {10968#true} is VALID [2022-02-20 19:58:10,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {10968#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10968#true} is VALID [2022-02-20 19:58:10,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {10968#true} assume !(0 != ~tmp~1); {10968#true} is VALID [2022-02-20 19:58:10,500 INFO L272 TraceCheckUtils]: 28: Hoare triple {10968#true} call #t~ret9 := is_do_read_c_triggered(); {10968#true} is VALID [2022-02-20 19:58:10,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {10968#true} havoc ~__retres1~1; {10968#true} is VALID [2022-02-20 19:58:10,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {10968#true} assume 1 == ~c_dr_pc~0; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,501 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} {10968#true} #1799#return; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:10,503 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11026#(= (+ (- 1) ~c_dr_pc~0) 0)} {10975#(not (= ~c_dr_pc~0 1))} #1805#return; {10969#false} is VALID [2022-02-20 19:58:10,503 INFO L272 TraceCheckUtils]: 39: Hoare triple {10969#false} call reset_delta_events1(); {11012#(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:58:10,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {11012#(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); {10968#true} is VALID [2022-02-20 19:58:10,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {10968#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10968#true} is VALID [2022-02-20 19:58:10,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,503 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10968#true} {10969#false} #1807#return; {10969#false} is VALID [2022-02-20 19:58:10,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {10969#false} assume !false; {10969#false} is VALID [2022-02-20 19:58:10,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {10969#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; {10969#false} is VALID [2022-02-20 19:58:10,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {10969#false} assume !false; {10969#false} is VALID [2022-02-20 19:58:10,504 INFO L272 TraceCheckUtils]: 47: Hoare triple {10969#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10968#true} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {10968#true} havoc ~__retres1~2; {10968#true} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {10968#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10968#true} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {10968#true} #res := ~__retres1~2; {10968#true} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {10968#true} assume true; {10968#true} is VALID [2022-02-20 19:58:10,504 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10968#true} {10969#false} #1809#return; {10969#false} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {10969#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; {10969#false} is VALID [2022-02-20 19:58:10,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {10969#false} assume 0 != eval1_~tmp___1~0#1; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {10969#false} assume !(0 == ~p_dw_st~0); {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {10969#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {10969#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {10969#false} assume 0 == ~c_dr_pc~0; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {10969#false} assume !false; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {10969#false} assume !(1 == ~q_free~0); {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {10969#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {10969#false} is VALID [2022-02-20 19:58:10,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {10969#false} assume !(~p_last_write~0 == ~c_last_read~0); {10969#false} is VALID [2022-02-20 19:58:10,506 INFO L272 TraceCheckUtils]: 63: Hoare triple {10969#false} call error1(); {10969#false} is VALID [2022-02-20 19:58:10,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {10969#false} assume !false; {10969#false} is VALID [2022-02-20 19:58:10,506 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:58:10,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030625726] [2022-02-20 19:58:10,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030625726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:10,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263585198] [2022-02-20 19:58:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:10,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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:58:10,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:10,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:10,552 INFO L87 Difference]: Start difference. First operand 652 states and 967 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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:58:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,937 INFO L93 Difference]: Finished difference Result 1974 states and 2763 transitions. [2022-02-20 19:58:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:15,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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:58:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1372 transitions. [2022-02-20 19:58:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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:58:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1372 transitions. [2022-02-20 19:58:15,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1372 transitions. [2022-02-20 19:58:16,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1372 edges. 1372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:16,975 INFO L225 Difference]: With dead ends: 1974 [2022-02-20 19:58:16,975 INFO L226 Difference]: Without dead ends: 1684 [2022-02-20 19:58:16,977 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:58:16,983 INFO L933 BasicCegarLoop]: 789 mSDtfsCounter, 3873 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3887 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:16,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3887 Valid, 2509 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:58:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-02-20 19:58:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1553. [2022-02-20 19:58:17,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:17,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1684 states. Second operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:17,057 INFO L74 IsIncluded]: Start isIncluded. First operand 1684 states. Second operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:17,060 INFO L87 Difference]: Start difference. First operand 1684 states. Second operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,150 INFO L93 Difference]: Finished difference Result 1684 states and 2257 transitions. [2022-02-20 19:58:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2257 transitions. [2022-02-20 19:58:17,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:17,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:17,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1684 states. [2022-02-20 19:58:17,159 INFO L87 Difference]: Start difference. First operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1684 states. [2022-02-20 19:58:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,249 INFO L93 Difference]: Finished difference Result 1684 states and 2257 transitions. [2022-02-20 19:58:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2257 transitions. [2022-02-20 19:58:17,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:17,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:17,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:17,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1294 states have internal predecessors, (1770), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2108 transitions. [2022-02-20 19:58:17,368 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2108 transitions. Word has length 65 [2022-02-20 19:58:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:17,368 INFO L470 AbstractCegarLoop]: Abstraction has 1553 states and 2108 transitions. [2022-02-20 19:58:17,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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:58:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2108 transitions. [2022-02-20 19:58:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:17,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:17,370 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:17,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:17,371 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1935052623, now seen corresponding path program 1 times [2022-02-20 19:58:17,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:17,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533490777] [2022-02-20 19:58:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {19225#(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); {19186#true} is VALID [2022-02-20 19:58:17,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19186#true} {19186#true} #1801#return; {19186#true} is VALID [2022-02-20 19:58:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {19226#(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); {19186#true} is VALID [2022-02-20 19:58:17,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume !(0 == ~q_write_ev~0); {19186#true} is VALID [2022-02-20 19:58:17,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19186#true} {19186#true} #1803#return; {19186#true} is VALID [2022-02-20 19:58:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#true} havoc ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume !(1 == ~p_dw_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} ~__retres1~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#true} #res := ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19186#true} {19186#true} #1797#return; {19186#true} is VALID [2022-02-20 19:58:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#true} havoc ~__retres1~1; {19186#true} is VALID [2022-02-20 19:58:17,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume !(1 == ~c_dr_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} ~__retres1~1 := 0; {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:17,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,501 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19186#true} #1799#return; {19240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:17,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {19227#(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; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L272 TraceCheckUtils]: 1: Hoare triple {19186#true} call #t~ret8 := is_do_write_p_triggered(); {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} havoc ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#true} assume !(1 == ~p_dw_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {19186#true} ~__retres1~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {19186#true} #res := ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19186#true} {19186#true} #1797#return; {19186#true} is VALID [2022-02-20 19:58:17,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {19186#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19186#true} is VALID [2022-02-20 19:58:17,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {19186#true} assume !(0 != ~tmp~1); {19186#true} is VALID [2022-02-20 19:58:17,503 INFO L272 TraceCheckUtils]: 10: Hoare triple {19186#true} call #t~ret9 := is_do_read_c_triggered(); {19186#true} is VALID [2022-02-20 19:58:17,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {19186#true} havoc ~__retres1~1; {19186#true} is VALID [2022-02-20 19:58:17,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {19186#true} assume !(1 == ~c_dr_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {19186#true} ~__retres1~1 := 0; {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:17,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19186#true} #1799#return; {19240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:17,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {19240#(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; {19241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:17,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {19241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19187#false} is VALID [2022-02-20 19:58:17,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {19187#false} assume true; {19187#false} is VALID [2022-02-20 19:58:17,505 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19187#false} {19186#true} #1805#return; {19187#false} is VALID [2022-02-20 19:58:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {19226#(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); {19186#true} is VALID [2022-02-20 19:58:17,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19186#true} is VALID [2022-02-20 19:58:17,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19186#true} {19187#false} #1807#return; {19187#false} is VALID [2022-02-20 19:58:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#true} havoc ~__retres1~2; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} #res := ~__retres1~2; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19186#true} {19187#false} #1809#return; {19187#false} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {19186#true} is VALID [2022-02-20 19:58:17,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#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; {19186#true} is VALID [2022-02-20 19:58:17,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {19186#true} call update_channels1(); {19225#(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:58:17,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {19225#(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); {19186#true} is VALID [2022-02-20 19:58:17,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,519 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19186#true} {19186#true} #1801#return; {19186#true} is VALID [2022-02-20 19:58:17,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {19186#true} assume { :begin_inline_init_threads1 } true; {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {19186#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {19186#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {19186#true} assume { :end_inline_init_threads1 } true; {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L272 TraceCheckUtils]: 12: Hoare triple {19186#true} call fire_delta_events1(); {19226#(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:58:17,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {19226#(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); {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {19186#true} assume !(0 == ~q_write_ev~0); {19186#true} is VALID [2022-02-20 19:58:17,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,521 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19186#true} {19186#true} #1803#return; {19186#true} is VALID [2022-02-20 19:58:17,521 INFO L272 TraceCheckUtils]: 17: Hoare triple {19186#true} call activate_threads1(); {19227#(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:58:17,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {19227#(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; {19186#true} is VALID [2022-02-20 19:58:17,521 INFO L272 TraceCheckUtils]: 19: Hoare triple {19186#true} call #t~ret8 := is_do_write_p_triggered(); {19186#true} is VALID [2022-02-20 19:58:17,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {19186#true} havoc ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {19186#true} assume !(1 == ~p_dw_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {19186#true} ~__retres1~0 := 0; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {19186#true} #res := ~__retres1~0; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19186#true} {19186#true} #1797#return; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {19186#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {19186#true} assume !(0 != ~tmp~1); {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L272 TraceCheckUtils]: 28: Hoare triple {19186#true} call #t~ret9 := is_do_read_c_triggered(); {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {19186#true} havoc ~__retres1~1; {19186#true} is VALID [2022-02-20 19:58:17,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {19186#true} assume !(1 == ~c_dr_pc~0); {19186#true} is VALID [2022-02-20 19:58:17,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {19186#true} ~__retres1~1 := 0; {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:17,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {19242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:17,524 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19186#true} #1799#return; {19240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:17,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {19240#(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; {19241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {19241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {19187#false} assume true; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19187#false} {19186#true} #1805#return; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L272 TraceCheckUtils]: 39: Hoare triple {19187#false} call reset_delta_events1(); {19226#(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:58:17,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {19226#(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); {19186#true} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {19186#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19186#true} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,525 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19186#true} {19187#false} #1807#return; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:58:17,525 INFO L272 TraceCheckUtils]: 47: Hoare triple {19187#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19186#true} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {19186#true} havoc ~__retres1~2; {19186#true} is VALID [2022-02-20 19:58:17,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {19186#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19186#true} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {19186#true} #res := ~__retres1~2; {19186#true} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {19186#true} assume true; {19186#true} is VALID [2022-02-20 19:58:17,526 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19186#true} {19187#false} #1809#return; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {19187#false} assume 0 != eval1_~tmp___1~0#1; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {19187#false} assume !(0 == ~p_dw_st~0); {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {19187#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {19187#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {19187#false} assume 0 == ~c_dr_pc~0; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {19187#false} assume !(1 == ~q_free~0); {19187#false} is VALID [2022-02-20 19:58:17,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {19187#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {19187#false} is VALID [2022-02-20 19:58:17,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {19187#false} assume !(~p_last_write~0 == ~c_last_read~0); {19187#false} is VALID [2022-02-20 19:58:17,527 INFO L272 TraceCheckUtils]: 63: Hoare triple {19187#false} call error1(); {19187#false} is VALID [2022-02-20 19:58:17,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:58:17,527 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:58:17,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:17,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533490777] [2022-02-20 19:58:17,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533490777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:17,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:17,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:17,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391267721] [2022-02-20 19:58:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:17,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:17,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:17,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:17,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:17,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:17,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:17,565 INFO L87 Difference]: Start difference. First operand 1553 states and 2108 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:21,088 INFO L93 Difference]: Finished difference Result 2844 states and 3781 transitions. [2022-02-20 19:58:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 853 transitions. [2022-02-20 19:58:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 853 transitions. [2022-02-20 19:58:21,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 853 transitions. [2022-02-20 19:58:21,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 853 edges. 853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:21,746 INFO L225 Difference]: With dead ends: 2844 [2022-02-20 19:58:21,746 INFO L226 Difference]: Without dead ends: 1659 [2022-02-20 19:58:21,748 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:58:21,748 INFO L933 BasicCegarLoop]: 681 mSDtfsCounter, 912 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:21,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 2738 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-02-20 19:58:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1583. [2022-02-20 19:58:21,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:21,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1659 states. Second operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:21,818 INFO L74 IsIncluded]: Start isIncluded. First operand 1659 states. Second operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:21,820 INFO L87 Difference]: Start difference. First operand 1659 states. Second operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:21,906 INFO L93 Difference]: Finished difference Result 1659 states and 2221 transitions. [2022-02-20 19:58:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2221 transitions. [2022-02-20 19:58:21,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:21,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:21,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1659 states. [2022-02-20 19:58:21,915 INFO L87 Difference]: Start difference. First operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1659 states. [2022-02-20 19:58:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:21,997 INFO L93 Difference]: Finished difference Result 1659 states and 2221 transitions. [2022-02-20 19:58:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2221 transitions. [2022-02-20 19:58:22,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:22,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:22,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:22,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1294 states have (on average 1.3802163833075733) internal successors, (1786), 1318 states have internal predecessors, (1786), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2130 transitions. [2022-02-20 19:58:22,106 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2130 transitions. Word has length 65 [2022-02-20 19:58:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:22,106 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 2130 transitions. [2022-02-20 19:58:22,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:58:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2130 transitions. [2022-02-20 19:58:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:22,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:22,108 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:22,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:22,109 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -548849229, now seen corresponding path program 1 times [2022-02-20 19:58:22,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:22,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637068057] [2022-02-20 19:58:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {28549#(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); {28550#(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:58:22,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28550#(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:58:22,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1801#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {28550#(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); {28550#(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:58:22,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {28550#(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); {28550#(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:58:22,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28550#(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:58:22,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1803#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {28509#true} havoc ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {28509#true} assume !(1 == ~p_dw_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {28509#true} ~__retres1~0 := 0; {28509#true} is VALID [2022-02-20 19:58:22,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {28509#true} #res := ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,193 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28509#true} {28509#true} #1797#return; {28509#true} is VALID [2022-02-20 19:58:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {28509#true} havoc ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {28509#true} assume !(1 == ~c_dr_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {28509#true} ~__retres1~1 := 0; {28509#true} is VALID [2022-02-20 19:58:22,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {28509#true} #res := ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,196 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28509#true} {28509#true} #1799#return; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {28551#(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; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L272 TraceCheckUtils]: 1: Hoare triple {28509#true} call #t~ret8 := is_do_write_p_triggered(); {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {28509#true} havoc ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {28509#true} assume !(1 == ~p_dw_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {28509#true} ~__retres1~0 := 0; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {28509#true} #res := ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,197 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28509#true} {28509#true} #1797#return; {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {28509#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {28509#true} assume !(0 != ~tmp~1); {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L272 TraceCheckUtils]: 10: Hoare triple {28509#true} call #t~ret9 := is_do_read_c_triggered(); {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {28509#true} havoc ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {28509#true} assume !(1 == ~c_dr_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {28509#true} ~__retres1~1 := 0; {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {28509#true} #res := ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28509#true} {28509#true} #1799#return; {28509#true} is VALID [2022-02-20 19:58:22,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {28509#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28509#true} is VALID [2022-02-20 19:58:22,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {28509#true} assume !(0 != ~tmp___0~1); {28509#true} is VALID [2022-02-20 19:58:22,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,199 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28509#true} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1805#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {28550#(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); {28564#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:22,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {28564#(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; {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:22,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:22,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1807#return; {28510#false} is VALID [2022-02-20 19:58:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {28509#true} havoc ~__retres1~2; {28509#true} is VALID [2022-02-20 19:58:22,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {28509#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28509#true} is VALID [2022-02-20 19:58:22,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {28509#true} #res := ~__retres1~2; {28509#true} is VALID [2022-02-20 19:58:22,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,222 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28509#true} {28510#false} #1809#return; {28510#false} is VALID [2022-02-20 19:58:22,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {28509#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {28509#true} is VALID [2022-02-20 19:58:22,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {28509#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {28509#true} is VALID [2022-02-20 19:58:22,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {28509#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {28511#(= ~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; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {28549#(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:58:22,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {28549#(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); {28550#(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:58:22,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28550#(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:58:22,225 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1801#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {28550#(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:58:22,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {28550#(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); {28550#(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:58:22,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {28550#(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); {28550#(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:58:22,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28550#(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:58:22,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1803#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {28551#(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:58:22,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {28551#(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; {28509#true} is VALID [2022-02-20 19:58:22,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {28509#true} call #t~ret8 := is_do_write_p_triggered(); {28509#true} is VALID [2022-02-20 19:58:22,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {28509#true} havoc ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {28509#true} assume !(1 == ~p_dw_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {28509#true} ~__retres1~0 := 0; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {28509#true} #res := ~__retres1~0; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28509#true} {28509#true} #1797#return; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {28509#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {28509#true} assume !(0 != ~tmp~1); {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L272 TraceCheckUtils]: 28: Hoare triple {28509#true} call #t~ret9 := is_do_read_c_triggered(); {28509#true} is VALID [2022-02-20 19:58:22,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {28509#true} havoc ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {28509#true} assume !(1 == ~c_dr_pc~0); {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {28509#true} ~__retres1~1 := 0; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {28509#true} #res := ~__retres1~1; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28509#true} {28509#true} #1799#return; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {28509#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {28509#true} assume !(0 != ~tmp___0~1); {28509#true} is VALID [2022-02-20 19:58:22,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,231 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28509#true} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1805#return; {28511#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:22,231 INFO L272 TraceCheckUtils]: 39: Hoare triple {28511#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {28550#(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:58:22,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {28550#(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); {28564#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:22,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {28564#(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; {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:22,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:22,232 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {28565#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28511#(= ~q_write_ev~0 ~q_read_ev~0)} #1807#return; {28510#false} is VALID [2022-02-20 19:58:22,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {28510#false} assume !false; {28510#false} is VALID [2022-02-20 19:58:22,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {28510#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; {28510#false} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {28510#false} assume !false; {28510#false} is VALID [2022-02-20 19:58:22,234 INFO L272 TraceCheckUtils]: 47: Hoare triple {28510#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28509#true} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {28509#true} havoc ~__retres1~2; {28509#true} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {28509#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28509#true} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {28509#true} #res := ~__retres1~2; {28509#true} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {28509#true} assume true; {28509#true} is VALID [2022-02-20 19:58:22,234 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28509#true} {28510#false} #1809#return; {28510#false} is VALID [2022-02-20 19:58:22,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {28510#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; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {28510#false} assume 0 != eval1_~tmp___1~0#1; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {28510#false} assume !(0 == ~p_dw_st~0); {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {28510#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {28510#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {28510#false} assume 0 == ~c_dr_pc~0; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {28510#false} assume !false; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {28510#false} assume !(1 == ~q_free~0); {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {28510#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {28510#false} is VALID [2022-02-20 19:58:22,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {28510#false} assume !(~p_last_write~0 == ~c_last_read~0); {28510#false} is VALID [2022-02-20 19:58:22,236 INFO L272 TraceCheckUtils]: 63: Hoare triple {28510#false} call error1(); {28510#false} is VALID [2022-02-20 19:58:22,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {28510#false} assume !false; {28510#false} is VALID [2022-02-20 19:58:22,236 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:58:22,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:22,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637068057] [2022-02-20 19:58:22,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637068057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:22,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:22,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:22,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249028346] [2022-02-20 19:58:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:22,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:22,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:22,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:22,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:22,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:22,273 INFO L87 Difference]: Start difference. First operand 1583 states and 2130 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:25,506 INFO L93 Difference]: Finished difference Result 2838 states and 3677 transitions. [2022-02-20 19:58:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1011 transitions. [2022-02-20 19:58:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1011 transitions. [2022-02-20 19:58:25,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1011 transitions. [2022-02-20 19:58:26,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1011 edges. 1011 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:26,284 INFO L225 Difference]: With dead ends: 2838 [2022-02-20 19:58:26,284 INFO L226 Difference]: Without dead ends: 1846 [2022-02-20 19:58:26,286 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:58:26,286 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 1689 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:26,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1717 Valid, 2033 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-02-20 19:58:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1525. [2022-02-20 19:58:26,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:26,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1846 states. Second operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:58:26,363 INFO L74 IsIncluded]: Start isIncluded. First operand 1846 states. Second operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:58:26,365 INFO L87 Difference]: Start difference. First operand 1846 states. Second operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:58:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:26,458 INFO L93 Difference]: Finished difference Result 1846 states and 2392 transitions. [2022-02-20 19:58:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2392 transitions. [2022-02-20 19:58:26,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:26,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:26,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) Second operand 1846 states. [2022-02-20 19:58:26,465 INFO L87 Difference]: Start difference. First operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) Second operand 1846 states. [2022-02-20 19:58:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:26,563 INFO L93 Difference]: Finished difference Result 1846 states and 2392 transitions. [2022-02-20 19:58:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2392 transitions. [2022-02-20 19:58:26,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:26,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:26,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1252 states have (on average 1.3777955271565496) internal successors, (1725), 1271 states have internal predecessors, (1725), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:58:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2048 transitions. [2022-02-20 19:58:26,651 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2048 transitions. Word has length 65 [2022-02-20 19:58:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:26,651 INFO L470 AbstractCegarLoop]: Abstraction has 1525 states and 2048 transitions. [2022-02-20 19:58:26,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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:58:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2048 transitions. [2022-02-20 19:58:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:26,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:26,652 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:26,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:26,653 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -682862735, now seen corresponding path program 1 times [2022-02-20 19:58:26,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:26,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813519237] [2022-02-20 19:58:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {38129#(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); {38089#true} is VALID [2022-02-20 19:58:26,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38089#true} {38089#true} #1801#return; {38089#true} is VALID [2022-02-20 19:58:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {38130#(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); {38089#true} is VALID [2022-02-20 19:58:26,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume !(0 == ~q_write_ev~0); {38089#true} is VALID [2022-02-20 19:58:26,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38089#true} {38094#(= ~p_dw_st~0 0)} #1803#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {38089#true} havoc ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume !(1 == ~p_dw_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} ~__retres1~0 := 0; {38089#true} is VALID [2022-02-20 19:58:26,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {38089#true} #res := ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,706 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1797#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {38089#true} havoc ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume !(1 == ~c_dr_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} ~__retres1~1 := 0; {38089#true} is VALID [2022-02-20 19:58:26,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {38089#true} #res := ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,710 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1799#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {38131#(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; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,710 INFO L272 TraceCheckUtils]: 1: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38089#true} is VALID [2022-02-20 19:58:26,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} havoc ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {38089#true} assume !(1 == ~p_dw_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {38089#true} ~__retres1~0 := 0; {38089#true} is VALID [2022-02-20 19:58:26,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {38089#true} #res := ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,711 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1797#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38089#true} is VALID [2022-02-20 19:58:26,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {38089#true} havoc ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {38089#true} assume !(1 == ~c_dr_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {38089#true} ~__retres1~1 := 0; {38089#true} is VALID [2022-02-20 19:58:26,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {38089#true} #res := ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,713 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1799#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,714 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38094#(= ~p_dw_st~0 0)} #1805#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {38130#(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); {38089#true} is VALID [2022-02-20 19:58:26,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume !(1 == ~q_write_ev~0); {38089#true} is VALID [2022-02-20 19:58:26,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38089#true} {38094#(= ~p_dw_st~0 0)} #1807#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:26,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {38089#true} havoc ~__retres1~2; {38089#true} is VALID [2022-02-20 19:58:26,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {38094#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {38094#(= ~p_dw_st~0 0)} assume true; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,730 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38094#(= ~p_dw_st~0 0)} {38094#(= ~p_dw_st~0 0)} #1809#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {38089#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {38089#true} is VALID [2022-02-20 19:58:26,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {38089#true} is VALID [2022-02-20 19:58:26,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {38089#true} is VALID [2022-02-20 19:58:26,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {38089#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; {38089#true} is VALID [2022-02-20 19:58:26,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {38089#true} call update_channels1(); {38129#(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:58:26,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {38129#(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); {38089#true} is VALID [2022-02-20 19:58:26,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,753 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38089#true} {38089#true} #1801#return; {38089#true} is VALID [2022-02-20 19:58:26,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {38089#true} assume { :begin_inline_init_threads1 } true; {38089#true} is VALID [2022-02-20 19:58:26,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {38089#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {38094#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {38094#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,754 INFO L272 TraceCheckUtils]: 12: Hoare triple {38094#(= ~p_dw_st~0 0)} call fire_delta_events1(); {38130#(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:58:26,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {38130#(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); {38089#true} is VALID [2022-02-20 19:58:26,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {38089#true} assume !(0 == ~q_write_ev~0); {38089#true} is VALID [2022-02-20 19:58:26,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,755 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38089#true} {38094#(= ~p_dw_st~0 0)} #1803#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,755 INFO L272 TraceCheckUtils]: 17: Hoare triple {38094#(= ~p_dw_st~0 0)} call activate_threads1(); {38131#(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:58:26,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {38131#(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; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,756 INFO L272 TraceCheckUtils]: 19: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38089#true} is VALID [2022-02-20 19:58:26,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {38089#true} havoc ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {38089#true} assume !(1 == ~p_dw_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {38089#true} ~__retres1~0 := 0; {38089#true} is VALID [2022-02-20 19:58:26,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {38089#true} #res := ~__retres1~0; {38089#true} is VALID [2022-02-20 19:58:26,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,757 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1797#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,758 INFO L272 TraceCheckUtils]: 28: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38089#true} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {38089#true} havoc ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {38089#true} assume !(1 == ~c_dr_pc~0); {38089#true} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {38089#true} ~__retres1~1 := 0; {38089#true} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {38089#true} #res := ~__retres1~1; {38089#true} is VALID [2022-02-20 19:58:26,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,759 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38089#true} {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1799#return; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:26,760 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38132#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38094#(= ~p_dw_st~0 0)} #1805#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,760 INFO L272 TraceCheckUtils]: 39: Hoare triple {38094#(= ~p_dw_st~0 0)} call reset_delta_events1(); {38130#(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:58:26,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {38130#(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); {38089#true} is VALID [2022-02-20 19:58:26,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {38089#true} assume !(1 == ~q_write_ev~0); {38089#true} is VALID [2022-02-20 19:58:26,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-02-20 19:58:26,761 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {38089#true} {38094#(= ~p_dw_st~0 0)} #1807#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {38094#(= ~p_dw_st~0 0)} assume !false; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {38094#(= ~p_dw_st~0 0)} 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; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {38094#(= ~p_dw_st~0 0)} assume !false; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,762 INFO L272 TraceCheckUtils]: 47: Hoare triple {38094#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38089#true} is VALID [2022-02-20 19:58:26,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {38089#true} havoc ~__retres1~2; {38089#true} is VALID [2022-02-20 19:58:26,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {38089#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {38094#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {38094#(= ~p_dw_st~0 0)} assume true; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,763 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38094#(= ~p_dw_st~0 0)} {38094#(= ~p_dw_st~0 0)} #1809#return; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {38094#(= ~p_dw_st~0 0)} 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; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {38094#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {38094#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {38094#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {38090#false} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {38090#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {38090#false} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {38090#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {38090#false} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {38090#false} assume 0 == ~c_dr_pc~0; {38090#false} is VALID [2022-02-20 19:58:26,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {38090#false} assume !false; {38090#false} is VALID [2022-02-20 19:58:26,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {38090#false} assume !(1 == ~q_free~0); {38090#false} is VALID [2022-02-20 19:58:26,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {38090#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {38090#false} is VALID [2022-02-20 19:58:26,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {38090#false} assume !(~p_last_write~0 == ~c_last_read~0); {38090#false} is VALID [2022-02-20 19:58:26,765 INFO L272 TraceCheckUtils]: 63: Hoare triple {38090#false} call error1(); {38090#false} is VALID [2022-02-20 19:58:26,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {38090#false} assume !false; {38090#false} is VALID [2022-02-20 19:58:26,765 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:58:26,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:26,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813519237] [2022-02-20 19:58:26,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813519237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:26,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:26,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:26,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713893423] [2022-02-20 19:58:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 65 [2022-02-20 19:58:26,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:26,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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:58:26,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:26,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:26,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:26,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:26,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:26,798 INFO L87 Difference]: Start difference. First operand 1525 states and 2048 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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:58:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,116 INFO L93 Difference]: Finished difference Result 3864 states and 5009 transitions. [2022-02-20 19:58:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 65 [2022-02-20 19:58:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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:58:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 971 transitions. [2022-02-20 19:58:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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:58:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 971 transitions. [2022-02-20 19:58:29,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 971 transitions. [2022-02-20 19:58:29,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 971 edges. 971 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:30,015 INFO L225 Difference]: With dead ends: 3864 [2022-02-20 19:58:30,015 INFO L226 Difference]: Without dead ends: 2708 [2022-02-20 19:58:30,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:30,017 INFO L933 BasicCegarLoop]: 664 mSDtfsCounter, 1672 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:30,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 1665 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2022-02-20 19:58:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2588. [2022-02-20 19:58:30,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:30,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2708 states. Second operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2022-02-20 19:58:30,154 INFO L74 IsIncluded]: Start isIncluded. First operand 2708 states. Second operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2022-02-20 19:58:30,157 INFO L87 Difference]: Start difference. First operand 2708 states. Second operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2022-02-20 19:58:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,352 INFO L93 Difference]: Finished difference Result 2708 states and 3483 transitions. [2022-02-20 19:58:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3483 transitions. [2022-02-20 19:58:30,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:30,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:30,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) Second operand 2708 states. [2022-02-20 19:58:30,362 INFO L87 Difference]: Start difference. First operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) Second operand 2708 states. [2022-02-20 19:58:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,553 INFO L93 Difference]: Finished difference Result 2708 states and 3483 transitions. [2022-02-20 19:58:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3483 transitions. [2022-02-20 19:58:30,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:30,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:30,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:30,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2072 states have (on average 1.3112934362934363) internal successors, (2717), 2108 states have internal predecessors, (2717), 264 states have call successors, (264), 206 states have call predecessors, (264), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2022-02-20 19:58:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3350 transitions. [2022-02-20 19:58:30,840 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3350 transitions. Word has length 65 [2022-02-20 19:58:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:30,840 INFO L470 AbstractCegarLoop]: Abstraction has 2588 states and 3350 transitions. [2022-02-20 19:58:30,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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:58:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3350 transitions. [2022-02-20 19:58:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:30,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:30,842 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:30,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:30,842 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash 988669412, now seen corresponding path program 1 times [2022-02-20 19:58:30,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:30,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922780897] [2022-02-20 19:58:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {52275#(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); {52235#true} is VALID [2022-02-20 19:58:30,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1801#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {52276#(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); {52235#true} is VALID [2022-02-20 19:58:30,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume !(0 == ~q_write_ev~0); {52235#true} is VALID [2022-02-20 19:58:30,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1803#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {52235#true} havoc ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume !(1 == ~p_dw_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} ~__retres1~0 := 0; {52235#true} is VALID [2022-02-20 19:58:30,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {52235#true} #res := ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,923 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {52235#true} {52235#true} #1797#return; {52235#true} is VALID [2022-02-20 19:58:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {52235#true} havoc ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume !(1 == ~c_dr_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} ~__retres1~1 := 0; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {52235#true} #res := ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {52235#true} {52235#true} #1799#return; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {52277#(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; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L272 TraceCheckUtils]: 1: Hoare triple {52235#true} call #t~ret8 := is_do_write_p_triggered(); {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} havoc ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {52235#true} assume !(1 == ~p_dw_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {52235#true} ~__retres1~0 := 0; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {52235#true} #res := ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52235#true} {52235#true} #1797#return; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {52235#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {52235#true} assume !(0 != ~tmp~1); {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L272 TraceCheckUtils]: 10: Hoare triple {52235#true} call #t~ret9 := is_do_read_c_triggered(); {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {52235#true} havoc ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {52235#true} assume !(1 == ~c_dr_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {52235#true} ~__retres1~1 := 0; {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {52235#true} #res := ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52235#true} {52235#true} #1799#return; {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {52235#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {52235#true} assume !(0 != ~tmp___0~1); {52235#true} is VALID [2022-02-20 19:58:30,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,932 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1805#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {52276#(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); {52235#true} is VALID [2022-02-20 19:58:30,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume !(1 == ~q_write_ev~0); {52235#true} is VALID [2022-02-20 19:58:30,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1807#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {52235#true} havoc ~__retres1~2; {52235#true} is VALID [2022-02-20 19:58:30,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52235#true} is VALID [2022-02-20 19:58:30,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} #res := ~__retres1~2; {52235#true} is VALID [2022-02-20 19:58:30,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,941 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1809#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {52235#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {52235#true} is VALID [2022-02-20 19:58:30,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {52235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {52235#true} is VALID [2022-02-20 19:58:30,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {52235#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {52237#(= ~q_free~0 1)} 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; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {52237#(= ~q_free~0 1)} call update_channels1(); {52275#(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:58:30,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {52275#(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); {52235#true} is VALID [2022-02-20 19:58:30,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,943 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1801#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {52237#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {52237#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {52237#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {52237#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {52237#(= ~q_free~0 1)} call fire_delta_events1(); {52276#(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:58:30,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {52276#(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); {52235#true} is VALID [2022-02-20 19:58:30,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {52235#true} assume !(0 == ~q_write_ev~0); {52235#true} is VALID [2022-02-20 19:58:30,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,945 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1803#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {52237#(= ~q_free~0 1)} call activate_threads1(); {52277#(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:58:30,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {52277#(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; {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L272 TraceCheckUtils]: 19: Hoare triple {52235#true} call #t~ret8 := is_do_write_p_triggered(); {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {52235#true} havoc ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {52235#true} assume !(1 == ~p_dw_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {52235#true} ~__retres1~0 := 0; {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {52235#true} #res := ~__retres1~0; {52235#true} is VALID [2022-02-20 19:58:30,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {52235#true} {52235#true} #1797#return; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {52235#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {52235#true} assume !(0 != ~tmp~1); {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L272 TraceCheckUtils]: 28: Hoare triple {52235#true} call #t~ret9 := is_do_read_c_triggered(); {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {52235#true} havoc ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {52235#true} assume !(1 == ~c_dr_pc~0); {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {52235#true} ~__retres1~1 := 0; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {52235#true} #res := ~__retres1~1; {52235#true} is VALID [2022-02-20 19:58:30,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,948 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {52235#true} {52235#true} #1799#return; {52235#true} is VALID [2022-02-20 19:58:30,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {52235#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52235#true} is VALID [2022-02-20 19:58:30,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {52235#true} assume !(0 != ~tmp___0~1); {52235#true} is VALID [2022-02-20 19:58:30,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,948 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1805#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,949 INFO L272 TraceCheckUtils]: 39: Hoare triple {52237#(= ~q_free~0 1)} call reset_delta_events1(); {52276#(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:58:30,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {52276#(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); {52235#true} is VALID [2022-02-20 19:58:30,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {52235#true} assume !(1 == ~q_write_ev~0); {52235#true} is VALID [2022-02-20 19:58:30,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,949 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1807#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {52237#(= ~q_free~0 1)} assume !false; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {52237#(= ~q_free~0 1)} 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; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {52237#(= ~q_free~0 1)} assume !false; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,950 INFO L272 TraceCheckUtils]: 47: Hoare triple {52237#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {52235#true} is VALID [2022-02-20 19:58:30,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {52235#true} havoc ~__retres1~2; {52235#true} is VALID [2022-02-20 19:58:30,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {52235#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52235#true} is VALID [2022-02-20 19:58:30,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {52235#true} #res := ~__retres1~2; {52235#true} is VALID [2022-02-20 19:58:30,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {52235#true} assume true; {52235#true} is VALID [2022-02-20 19:58:30,951 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52235#true} {52237#(= ~q_free~0 1)} #1809#return; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {52237#(= ~q_free~0 1)} 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; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {52237#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {52237#(= ~q_free~0 1)} 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; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {52237#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {52237#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {52237#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {52237#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {52237#(= ~q_free~0 1)} assume !false; {52237#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:30,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {52237#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {52236#false} is VALID [2022-02-20 19:58:30,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {52236#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {52236#false} is VALID [2022-02-20 19:58:30,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {52236#false} assume !(~p_last_write~0 == ~c_last_read~0); {52236#false} is VALID [2022-02-20 19:58:30,954 INFO L272 TraceCheckUtils]: 64: Hoare triple {52236#false} call error1(); {52236#false} is VALID [2022-02-20 19:58:30,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {52236#false} assume !false; {52236#false} is VALID [2022-02-20 19:58:30,954 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:58:30,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:30,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922780897] [2022-02-20 19:58:30,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922780897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:30,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:30,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:30,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640418248] [2022-02-20 19:58:30,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:30,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:30,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:30,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:30,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:30,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:30,995 INFO L87 Difference]: Start difference. First operand 2588 states and 3350 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:34,181 INFO L93 Difference]: Finished difference Result 5904 states and 7495 transitions. [2022-02-20 19:58:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-02-20 19:58:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-02-20 19:58:34,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 961 transitions. [2022-02-20 19:58:34,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 961 edges. 961 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:35,349 INFO L225 Difference]: With dead ends: 5904 [2022-02-20 19:58:35,349 INFO L226 Difference]: Without dead ends: 3690 [2022-02-20 19:58:35,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:35,352 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 788 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:35,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 1968 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2022-02-20 19:58:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3422. [2022-02-20 19:58:35,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:35,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3690 states. Second operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2022-02-20 19:58:35,551 INFO L74 IsIncluded]: Start isIncluded. First operand 3690 states. Second operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2022-02-20 19:58:35,555 INFO L87 Difference]: Start difference. First operand 3690 states. Second operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2022-02-20 19:58:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,951 INFO L93 Difference]: Finished difference Result 3690 states and 4663 transitions. [2022-02-20 19:58:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4663 transitions. [2022-02-20 19:58:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:35,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:35,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) Second operand 3690 states. [2022-02-20 19:58:35,968 INFO L87 Difference]: Start difference. First operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) Second operand 3690 states. [2022-02-20 19:58:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,348 INFO L93 Difference]: Finished difference Result 3690 states and 4663 transitions. [2022-02-20 19:58:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4663 transitions. [2022-02-20 19:58:36,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:36,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2720 states have (on average 1.2911764705882354) internal successors, (3512), 2761 states have internal predecessors, (3512), 356 states have call successors, (356), 286 states have call predecessors, (356), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2022-02-20 19:58:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4351 transitions. [2022-02-20 19:58:36,829 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4351 transitions. Word has length 66 [2022-02-20 19:58:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:36,829 INFO L470 AbstractCegarLoop]: Abstraction has 3422 states and 4351 transitions. [2022-02-20 19:58:36,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4351 transitions. [2022-02-20 19:58:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:36,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:36,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:36,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:36,831 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1936436605, now seen corresponding path program 1 times [2022-02-20 19:58:36,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:36,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745020404] [2022-02-20 19:58:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {72232#(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); {72192#true} is VALID [2022-02-20 19:58:36,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1801#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {72233#(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); {72192#true} is VALID [2022-02-20 19:58:36,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume !(0 == ~q_write_ev~0); {72192#true} is VALID [2022-02-20 19:58:36,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1803#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {72192#true} havoc ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume !(1 == ~p_dw_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} ~__retres1~0 := 0; {72192#true} is VALID [2022-02-20 19:58:36,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {72192#true} #res := ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,887 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {72192#true} {72192#true} #1797#return; {72192#true} is VALID [2022-02-20 19:58:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {72192#true} havoc ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume !(1 == ~c_dr_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} ~__retres1~1 := 0; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {72192#true} #res := ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {72192#true} {72192#true} #1799#return; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {72234#(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; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L272 TraceCheckUtils]: 1: Hoare triple {72192#true} call #t~ret8 := is_do_write_p_triggered(); {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} havoc ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {72192#true} assume !(1 == ~p_dw_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {72192#true} ~__retres1~0 := 0; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {72192#true} #res := ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {72192#true} {72192#true} #1797#return; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {72192#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {72192#true} assume !(0 != ~tmp~1); {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L272 TraceCheckUtils]: 10: Hoare triple {72192#true} call #t~ret9 := is_do_read_c_triggered(); {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {72192#true} havoc ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {72192#true} assume !(1 == ~c_dr_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {72192#true} ~__retres1~1 := 0; {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {72192#true} #res := ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {72192#true} {72192#true} #1799#return; {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {72192#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {72192#true} assume !(0 != ~tmp___0~1); {72192#true} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,893 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1805#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {72233#(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); {72192#true} is VALID [2022-02-20 19:58:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume !(1 == ~q_write_ev~0); {72192#true} is VALID [2022-02-20 19:58:36,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1807#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {72192#true} havoc ~__retres1~2; {72192#true} is VALID [2022-02-20 19:58:36,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72192#true} is VALID [2022-02-20 19:58:36,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} #res := ~__retres1~2; {72192#true} is VALID [2022-02-20 19:58:36,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,901 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1809#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {72192#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {72192#true} is VALID [2022-02-20 19:58:36,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {72192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {72192#true} is VALID [2022-02-20 19:58:36,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {72192#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {72194#(= ~p_dw_pc~0 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; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {72194#(= ~p_dw_pc~0 0)} call update_channels1(); {72232#(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:58:36,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {72232#(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); {72192#true} is VALID [2022-02-20 19:58:36,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1801#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {72194#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {72233#(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:58:36,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {72233#(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); {72192#true} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {72192#true} assume !(0 == ~q_write_ev~0); {72192#true} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,905 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1803#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,905 INFO L272 TraceCheckUtils]: 17: Hoare triple {72194#(= ~p_dw_pc~0 0)} call activate_threads1(); {72234#(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:58:36,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {72234#(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; {72192#true} is VALID [2022-02-20 19:58:36,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {72192#true} call #t~ret8 := is_do_write_p_triggered(); {72192#true} is VALID [2022-02-20 19:58:36,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {72192#true} havoc ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {72192#true} assume !(1 == ~p_dw_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {72192#true} ~__retres1~0 := 0; {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {72192#true} #res := ~__retres1~0; {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {72192#true} {72192#true} #1797#return; {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {72192#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {72192#true} assume !(0 != ~tmp~1); {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L272 TraceCheckUtils]: 28: Hoare triple {72192#true} call #t~ret9 := is_do_read_c_triggered(); {72192#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {72192#true} havoc ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {72192#true} assume !(1 == ~c_dr_pc~0); {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {72192#true} ~__retres1~1 := 0; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {72192#true} #res := ~__retres1~1; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72192#true} {72192#true} #1799#return; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {72192#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {72192#true} assume !(0 != ~tmp___0~1); {72192#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,908 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1805#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,908 INFO L272 TraceCheckUtils]: 39: Hoare triple {72194#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {72233#(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:58:36,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {72233#(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); {72192#true} is VALID [2022-02-20 19:58:36,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {72192#true} assume !(1 == ~q_write_ev~0); {72192#true} is VALID [2022-02-20 19:58:36,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,909 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1807#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume !false; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {72194#(= ~p_dw_pc~0 0)} 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; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume !false; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,910 INFO L272 TraceCheckUtils]: 47: Hoare triple {72194#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {72192#true} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {72192#true} havoc ~__retres1~2; {72192#true} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {72192#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72192#true} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {72192#true} #res := ~__retres1~2; {72192#true} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {72192#true} assume true; {72192#true} is VALID [2022-02-20 19:58:36,910 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72192#true} {72194#(= ~p_dw_pc~0 0)} #1809#return; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {72194#(= ~p_dw_pc~0 0)} 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; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {72194#(= ~p_dw_pc~0 0)} 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; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {72194#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {72194#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {72193#false} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {72193#false} assume 1 == ~p_dw_pc~0; {72193#false} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {72193#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {72193#false} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {72193#false} assume !false; {72193#false} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {72193#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {72193#false} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {72193#false} assume { :end_inline_do_write_p } true; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {72193#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {72193#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {72193#false} assume 0 == ~c_dr_pc~0; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {72193#false} assume !false; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {72193#false} assume !(1 == ~q_free~0); {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {72193#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {72193#false} assume !(~p_last_write~0 == ~c_last_read~0); {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L272 TraceCheckUtils]: 70: Hoare triple {72193#false} call error1(); {72193#false} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {72193#false} assume !false; {72193#false} is VALID [2022-02-20 19:58:36,914 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:58:36,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:36,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745020404] [2022-02-20 19:58:36,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745020404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:36,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:36,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:36,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635233326] [2022-02-20 19:58:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:36,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:36,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:36,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:36,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:36,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:36,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:36,953 INFO L87 Difference]: Start difference. First operand 3422 states and 4351 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:40,651 INFO L93 Difference]: Finished difference Result 7294 states and 9125 transitions. [2022-02-20 19:58:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:40,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2022-02-20 19:58:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2022-02-20 19:58:40,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 958 transitions. [2022-02-20 19:58:41,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 958 edges. 958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:41,989 INFO L225 Difference]: With dead ends: 7294 [2022-02-20 19:58:41,989 INFO L226 Difference]: Without dead ends: 4244 [2022-02-20 19:58:41,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:41,993 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 1637 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:41,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 1405 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2022-02-20 19:58:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 3976. [2022-02-20 19:58:42,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:42,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4244 states. Second operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) [2022-02-20 19:58:42,209 INFO L74 IsIncluded]: Start isIncluded. First operand 4244 states. Second operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) [2022-02-20 19:58:42,214 INFO L87 Difference]: Start difference. First operand 4244 states. Second operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) [2022-02-20 19:58:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,710 INFO L93 Difference]: Finished difference Result 4244 states and 5329 transitions. [2022-02-20 19:58:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 5329 transitions. [2022-02-20 19:58:42,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:42,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:42,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) Second operand 4244 states. [2022-02-20 19:58:42,725 INFO L87 Difference]: Start difference. First operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) Second operand 4244 states. [2022-02-20 19:58:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,210 INFO L93 Difference]: Finished difference Result 4244 states and 5329 transitions. [2022-02-20 19:58:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 5329 transitions. [2022-02-20 19:58:43,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:43,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3160 states have (on average 1.2822784810126582) internal successors, (4052), 3205 states have internal predecessors, (4052), 412 states have call successors, (412), 336 states have call predecessors, (412), 402 states have return successors, (556), 437 states have call predecessors, (556), 408 states have call successors, (556) [2022-02-20 19:58:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5020 transitions. [2022-02-20 19:58:43,845 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5020 transitions. Word has length 72 [2022-02-20 19:58:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:43,846 INFO L470 AbstractCegarLoop]: Abstraction has 3976 states and 5020 transitions. [2022-02-20 19:58:43,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5020 transitions. [2022-02-20 19:58:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:43,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:43,847 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:43,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:43,847 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -416876785, now seen corresponding path program 1 times [2022-02-20 19:58:43,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:43,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319561021] [2022-02-20 19:58:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {95920#(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); {95879#true} is VALID [2022-02-20 19:58:43,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95879#true} {95879#true} #1801#return; {95879#true} is VALID [2022-02-20 19:58:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {95921#(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); {95879#true} is VALID [2022-02-20 19:58:43,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume !(0 == ~q_write_ev~0); {95879#true} is VALID [2022-02-20 19:58:43,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95879#true} {95879#true} #1803#return; {95879#true} is VALID [2022-02-20 19:58:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {95879#true} havoc ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume !(1 == ~p_dw_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} ~__retres1~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {95879#true} #res := ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {95879#true} {95879#true} #1797#return; {95879#true} is VALID [2022-02-20 19:58:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {95879#true} havoc ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume !(1 == ~c_dr_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} ~__retres1~1 := 0; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {95879#true} #res := ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {95879#true} {95879#true} #1799#return; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {95922#(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; {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L272 TraceCheckUtils]: 1: Hoare triple {95879#true} call #t~ret8 := is_do_write_p_triggered(); {95879#true} is VALID [2022-02-20 19:58:43,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} havoc ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {95879#true} assume !(1 == ~p_dw_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {95879#true} ~__retres1~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {95879#true} #res := ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {95879#true} {95879#true} #1797#return; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {95879#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {95879#true} assume !(0 != ~tmp~1); {95879#true} is VALID [2022-02-20 19:58:43,908 INFO L272 TraceCheckUtils]: 10: Hoare triple {95879#true} call #t~ret9 := is_do_read_c_triggered(); {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {95879#true} havoc ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {95879#true} assume !(1 == ~c_dr_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {95879#true} ~__retres1~1 := 0; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {95879#true} #res := ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {95879#true} {95879#true} #1799#return; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {95879#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95879#true} is VALID [2022-02-20 19:58:43,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {95879#true} assume !(0 != ~tmp___0~1); {95879#true} is VALID [2022-02-20 19:58:43,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,910 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {95879#true} {95879#true} #1805#return; {95879#true} is VALID [2022-02-20 19:58:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {95921#(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); {95879#true} is VALID [2022-02-20 19:58:43,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume !(1 == ~q_write_ev~0); {95879#true} is VALID [2022-02-20 19:58:43,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95879#true} {95879#true} #1807#return; {95879#true} is VALID [2022-02-20 19:58:43,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:43,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {95879#true} havoc ~__retres1~2; {95879#true} is VALID [2022-02-20 19:58:43,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95879#true} is VALID [2022-02-20 19:58:43,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} #res := ~__retres1~2; {95879#true} is VALID [2022-02-20 19:58:43,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,916 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {95879#true} {95879#true} #1809#return; {95879#true} is VALID [2022-02-20 19:58:43,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {95879#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {95879#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {95879#true} is VALID [2022-02-20 19:58:43,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {95879#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {95879#true} is VALID [2022-02-20 19:58:43,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {95879#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; {95879#true} is VALID [2022-02-20 19:58:43,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {95879#true} call update_channels1(); {95920#(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:58:43,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {95920#(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); {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {95879#true} {95879#true} #1801#return; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {95879#true} assume { :begin_inline_init_threads1 } true; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {95879#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {95879#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {95879#true} assume { :end_inline_init_threads1 } true; {95879#true} is VALID [2022-02-20 19:58:43,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {95879#true} call fire_delta_events1(); {95921#(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:58:43,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {95921#(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); {95879#true} is VALID [2022-02-20 19:58:43,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {95879#true} assume !(0 == ~q_write_ev~0); {95879#true} is VALID [2022-02-20 19:58:43,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,919 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {95879#true} {95879#true} #1803#return; {95879#true} is VALID [2022-02-20 19:58:43,919 INFO L272 TraceCheckUtils]: 17: Hoare triple {95879#true} call activate_threads1(); {95922#(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:58:43,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {95922#(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; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {95879#true} call #t~ret8 := is_do_write_p_triggered(); {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {95879#true} havoc ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {95879#true} assume !(1 == ~p_dw_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {95879#true} ~__retres1~0 := 0; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {95879#true} #res := ~__retres1~0; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {95879#true} {95879#true} #1797#return; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {95879#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95879#true} is VALID [2022-02-20 19:58:43,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {95879#true} assume !(0 != ~tmp~1); {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L272 TraceCheckUtils]: 28: Hoare triple {95879#true} call #t~ret9 := is_do_read_c_triggered(); {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {95879#true} havoc ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {95879#true} assume !(1 == ~c_dr_pc~0); {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {95879#true} ~__retres1~1 := 0; {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {95879#true} #res := ~__retres1~1; {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {95879#true} {95879#true} #1799#return; {95879#true} is VALID [2022-02-20 19:58:43,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {95879#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95879#true} is VALID [2022-02-20 19:58:43,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {95879#true} assume !(0 != ~tmp___0~1); {95879#true} is VALID [2022-02-20 19:58:43,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,922 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {95879#true} {95879#true} #1805#return; {95879#true} is VALID [2022-02-20 19:58:43,922 INFO L272 TraceCheckUtils]: 39: Hoare triple {95879#true} call reset_delta_events1(); {95921#(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:58:43,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {95921#(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); {95879#true} is VALID [2022-02-20 19:58:43,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {95879#true} assume !(1 == ~q_write_ev~0); {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {95879#true} {95879#true} #1807#return; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {95879#true} assume !false; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {95879#true} 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; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {95879#true} assume !false; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L272 TraceCheckUtils]: 47: Hoare triple {95879#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {95879#true} havoc ~__retres1~2; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {95879#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95879#true} is VALID [2022-02-20 19:58:43,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {95879#true} #res := ~__retres1~2; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {95879#true} assume true; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {95879#true} {95879#true} #1809#return; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {95879#true} 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; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {95879#true} assume 0 != eval1_~tmp___1~0#1; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {95879#true} 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; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {95879#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {95879#true} assume 0 == ~p_dw_pc~0; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {95879#true} assume !false; {95879#true} is VALID [2022-02-20 19:58:43,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {95879#true} assume !(0 == ~q_free~0); {95879#true} is VALID [2022-02-20 19:58:43,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {95879#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {95918#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:43,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {95918#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {95919#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:43,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {95919#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {95880#false} is VALID [2022-02-20 19:58:43,928 INFO L272 TraceCheckUtils]: 71: Hoare triple {95880#false} call error1(); {95880#false} is VALID [2022-02-20 19:58:43,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {95880#false} assume !false; {95880#false} is VALID [2022-02-20 19:58:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:43,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:43,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319561021] [2022-02-20 19:58:43,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319561021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:43,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:43,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:43,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554331023] [2022-02-20 19:58:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:43,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:43,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:43,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:43,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:43,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:43,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:43,970 INFO L87 Difference]: Start difference. First operand 3976 states and 5020 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,129 INFO L93 Difference]: Finished difference Result 5062 states and 6315 transitions. [2022-02-20 19:58:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:47,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 841 transitions. [2022-02-20 19:58:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 841 transitions. [2022-02-20 19:58:47,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 841 transitions. [2022-02-20 19:58:47,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,713 INFO L225 Difference]: With dead ends: 5062 [2022-02-20 19:58:48,713 INFO L226 Difference]: Without dead ends: 5059 [2022-02-20 19:58:48,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:48,715 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 2298 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:48,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2308 Valid, 1383 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2022-02-20 19:58:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4438. [2022-02-20 19:58:48,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5059 states. Second operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) [2022-02-20 19:58:48,971 INFO L74 IsIncluded]: Start isIncluded. First operand 5059 states. Second operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) [2022-02-20 19:58:48,976 INFO L87 Difference]: Start difference. First operand 5059 states. Second operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) [2022-02-20 19:58:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:49,640 INFO L93 Difference]: Finished difference Result 5059 states and 6295 transitions. [2022-02-20 19:58:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6295 transitions. [2022-02-20 19:58:49,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:49,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:49,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) Second operand 5059 states. [2022-02-20 19:58:49,657 INFO L87 Difference]: Start difference. First operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) Second operand 5059 states. [2022-02-20 19:58:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,337 INFO L93 Difference]: Finished difference Result 5059 states and 6295 transitions. [2022-02-20 19:58:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6295 transitions. [2022-02-20 19:58:50,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:50,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 3515 states have (on average 1.2711237553342816) internal successors, (4468), 3563 states have internal predecessors, (4468), 462 states have call successors, (462), 380 states have call predecessors, (462), 459 states have return successors, (633), 497 states have call predecessors, (633), 459 states have call successors, (633) [2022-02-20 19:58:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5563 transitions. [2022-02-20 19:58:51,125 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5563 transitions. Word has length 73 [2022-02-20 19:58:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:51,125 INFO L470 AbstractCegarLoop]: Abstraction has 4438 states and 5563 transitions. [2022-02-20 19:58:51,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5563 transitions. [2022-02-20 19:58:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:51,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:51,126 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:51,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:51,127 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:51,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -39666611, now seen corresponding path program 1 times [2022-02-20 19:58:51,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:51,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790189935] [2022-02-20 19:58:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {118819#(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); {118777#true} is VALID [2022-02-20 19:58:51,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1801#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {118820#(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); {118777#true} is VALID [2022-02-20 19:58:51,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume !(0 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:51,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1803#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#true} havoc ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume !(1 == ~p_dw_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} ~__retres1~0 := 0; {118777#true} is VALID [2022-02-20 19:58:51,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {118777#true} #res := ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,224 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {118777#true} {118777#true} #1797#return; {118777#true} is VALID [2022-02-20 19:58:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#true} havoc ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume !(1 == ~c_dr_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} ~__retres1~1 := 0; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {118777#true} #res := ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {118777#true} {118777#true} #1799#return; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {118821#(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; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L272 TraceCheckUtils]: 1: Hoare triple {118777#true} call #t~ret8 := is_do_write_p_triggered(); {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} havoc ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {118777#true} assume !(1 == ~p_dw_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {118777#true} ~__retres1~0 := 0; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {118777#true} #res := ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118777#true} {118777#true} #1797#return; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {118777#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {118777#true} assume !(0 != ~tmp~1); {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L272 TraceCheckUtils]: 10: Hoare triple {118777#true} call #t~ret9 := is_do_read_c_triggered(); {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {118777#true} havoc ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {118777#true} assume !(1 == ~c_dr_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {118777#true} ~__retres1~1 := 0; {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {118777#true} #res := ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118777#true} {118777#true} #1799#return; {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {118777#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {118777#true} assume !(0 != ~tmp___0~1); {118777#true} is VALID [2022-02-20 19:58:51,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,232 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1805#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {118820#(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); {118777#true} is VALID [2022-02-20 19:58:51,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume !(1 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:51,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1807#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#true} havoc ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:51,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118777#true} is VALID [2022-02-20 19:58:51,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} #res := ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:51,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,241 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1809#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {118777#true} is VALID [2022-02-20 19:58:51,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {118777#true} is VALID [2022-02-20 19:58:51,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {118819#(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:58:51,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {118819#(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); {118777#true} is VALID [2022-02-20 19:58:51,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,243 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1801#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {118820#(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:58:51,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {118820#(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); {118777#true} is VALID [2022-02-20 19:58:51,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {118777#true} assume !(0 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:51,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,246 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1803#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,246 INFO L272 TraceCheckUtils]: 17: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {118821#(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:58:51,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {118821#(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; {118777#true} is VALID [2022-02-20 19:58:51,246 INFO L272 TraceCheckUtils]: 19: Hoare triple {118777#true} call #t~ret8 := is_do_write_p_triggered(); {118777#true} is VALID [2022-02-20 19:58:51,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {118777#true} havoc ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {118777#true} assume !(1 == ~p_dw_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {118777#true} ~__retres1~0 := 0; {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {118777#true} #res := ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118777#true} {118777#true} #1797#return; {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {118777#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {118777#true} assume !(0 != ~tmp~1); {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {118777#true} call #t~ret9 := is_do_read_c_triggered(); {118777#true} is VALID [2022-02-20 19:58:51,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {118777#true} havoc ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {118777#true} assume !(1 == ~c_dr_pc~0); {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {118777#true} ~__retres1~1 := 0; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {118777#true} #res := ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118777#true} {118777#true} #1799#return; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {118777#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {118777#true} assume !(0 != ~tmp___0~1); {118777#true} is VALID [2022-02-20 19:58:51,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,249 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1805#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,249 INFO L272 TraceCheckUtils]: 39: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {118820#(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:58:51,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {118820#(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); {118777#true} is VALID [2022-02-20 19:58:51,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {118777#true} assume !(1 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:51,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,250 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1807#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,251 INFO L272 TraceCheckUtils]: 47: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {118777#true} is VALID [2022-02-20 19:58:51,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {118777#true} havoc ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:51,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {118777#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118777#true} is VALID [2022-02-20 19:58:51,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {118777#true} #res := ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:51,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:51,252 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118777#true} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1809#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:51,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:51,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:51,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:51,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {118778#false} is VALID [2022-02-20 19:58:51,258 INFO L272 TraceCheckUtils]: 72: Hoare triple {118778#false} call error1(); {118778#false} is VALID [2022-02-20 19:58:51,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {118778#false} assume !false; {118778#false} is VALID [2022-02-20 19:58:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:51,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790189935] [2022-02-20 19:58:51,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790189935] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:51,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684093895] [2022-02-20 19:58:51,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:51,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:58:51,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:58:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:52,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {118777#true} is VALID [2022-02-20 19:58:52,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {118777#true} is VALID [2022-02-20 19:58:52,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,014 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1801#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,016 INFO L272 TraceCheckUtils]: 12: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,017 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1803#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,018 INFO L272 TraceCheckUtils]: 19: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,021 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1797#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,022 INFO L272 TraceCheckUtils]: 28: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,024 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1799#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,026 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1805#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,026 INFO L272 TraceCheckUtils]: 39: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,028 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1807#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,029 INFO L272 TraceCheckUtils]: 47: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,031 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1809#return; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,034 INFO L290 TraceCheckUtils]: 59: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:52,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {118779#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {118817#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {119044#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {119044#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {119044#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:52,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {119044#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {118778#false} is VALID [2022-02-20 19:58:52,039 INFO L272 TraceCheckUtils]: 72: Hoare triple {118778#false} call error1(); {118778#false} is VALID [2022-02-20 19:58:52,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {118778#false} assume !false; {118778#false} is VALID [2022-02-20 19:58:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:52,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:52,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {118778#false} assume !false; {118778#false} is VALID [2022-02-20 19:58:52,424 INFO L272 TraceCheckUtils]: 72: Hoare triple {118778#false} call error1(); {118778#false} is VALID [2022-02-20 19:58:52,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {118778#false} is VALID [2022-02-20 19:58:52,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {119069#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:52,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,432 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118777#true} {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1809#return; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {118777#true} #res := ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:52,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {118777#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118777#true} is VALID [2022-02-20 19:58:52,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {118777#true} havoc ~__retres1~2; {118777#true} is VALID [2022-02-20 19:58:52,433 INFO L272 TraceCheckUtils]: 47: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {118777#true} is VALID [2022-02-20 19:58:52,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,434 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118777#true} {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1807#return; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {118777#true} assume !(1 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {118777#true} assume !(1 == ~q_read_ev~0); {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L272 TraceCheckUtils]: 39: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118777#true} {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1805#return; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {118777#true} assume !(0 != ~tmp___0~1); {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {118777#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118777#true} is VALID [2022-02-20 19:58:52,435 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118777#true} {118777#true} #1799#return; {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {118777#true} #res := ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {118777#true} ~__retres1~1 := 0; {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {118777#true} assume !(1 == ~c_dr_pc~0); {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {118777#true} havoc ~__retres1~1; {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L272 TraceCheckUtils]: 28: Hoare triple {118777#true} call #t~ret9 := is_do_read_c_triggered(); {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {118777#true} assume !(0 != ~tmp~1); {118777#true} is VALID [2022-02-20 19:58:52,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {118777#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118777#true} {118777#true} #1797#return; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {118777#true} #res := ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {118777#true} ~__retres1~0 := 0; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {118777#true} assume !(1 == ~p_dw_pc~0); {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {118777#true} havoc ~__retres1~0; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L272 TraceCheckUtils]: 19: Hoare triple {118777#true} call #t~ret8 := is_do_write_p_triggered(); {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {118777#true} havoc ~tmp~1;havoc ~tmp___0~1; {118777#true} is VALID [2022-02-20 19:58:52,437 INFO L272 TraceCheckUtils]: 17: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {118777#true} is VALID [2022-02-20 19:58:52,438 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118777#true} {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1803#return; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {118777#true} assume !(0 == ~q_write_ev~0); {118777#true} is VALID [2022-02-20 19:58:52,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {118777#true} assume !(0 == ~q_read_ev~0); {118777#true} is VALID [2022-02-20 19:58:52,438 INFO L272 TraceCheckUtils]: 12: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {118777#true} is VALID [2022-02-20 19:58:52,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,440 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118777#true} {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1801#return; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {118777#true} assume true; {118777#true} is VALID [2022-02-20 19:58:52,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {118777#true} assume !(1 == ~q_req_up~0); {118777#true} is VALID [2022-02-20 19:58:52,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {118777#true} is VALID [2022-02-20 19:58:52,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {118777#true} assume 0 != main_#t~nondet49#1;havoc main_#t~nondet49#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; {118818#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:52,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {118777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~ret50#1, main_#t~ret51#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647; {118777#true} is VALID [2022-02-20 19:58:52,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {118777#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {118777#true} is VALID [2022-02-20 19:58:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:52,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684093895] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:52,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:52,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:52,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841116164] [2022-02-20 19:58:52,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:52,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:52,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:52,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:52,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:52,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:52,535 INFO L87 Difference]: Start difference. First operand 4438 states and 5563 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)