./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.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.04.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 284334fdd31c4c26d16d0bf558a458f462d11a8d54419841fe6fc9cdbb9a1cfc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:51,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:51,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:51,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:51,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:51,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:51,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:51,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:51,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:51,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:51,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:51,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:51,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:51,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:51,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:51,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:51,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:51,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:51,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:51,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:51,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:51,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:51,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:51,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:51,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:51,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:51,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:51,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:51,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:51,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:51,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:51,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:51,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:51,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:51,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:51,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:51,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:51,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:51,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:51,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:51,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:51,333 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:56:51,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:51,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:51,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:51,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:51,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:51,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:51,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:51,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:51,364 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:51,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:51,364 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:51,365 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:51,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:51,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:51,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:51,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:51,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:51,368 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 -> 284334fdd31c4c26d16d0bf558a458f462d11a8d54419841fe6fc9cdbb9a1cfc [2022-02-20 19:56:51,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:51,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:51,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:51,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:51,607 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:51,608 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.04.cil-1.c [2022-02-20 19:56:51,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c3df0b/389a3a6b16344b6c80331b8f18579534/FLAG28db09f38 [2022-02-20 19:56:52,048 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:52,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-1.c [2022-02-20 19:56:52,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c3df0b/389a3a6b16344b6c80331b8f18579534/FLAG28db09f38 [2022-02-20 19:56:52,064 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c3df0b/389a3a6b16344b6c80331b8f18579534 [2022-02-20 19:56:52,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:52,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:52,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:52,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:52,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:52,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58c3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52, skipping insertion in model container [2022-02-20 19:56:52,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:52,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:52,253 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.04.cil-1.c[914,927] [2022-02-20 19:56:52,304 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.04.cil-1.c[7115,7128] [2022-02-20 19:56:52,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:52,381 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:52,391 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.04.cil-1.c[914,927] [2022-02-20 19:56:52,418 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.04.cil-1.c[7115,7128] [2022-02-20 19:56:52,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:52,475 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:52,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52 WrapperNode [2022-02-20 19:56:52,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:52,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:52,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:52,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:52,483 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:56:52" (1/1) ... [2022-02-20 19:56:52,504 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:56:52" (1/1) ... [2022-02-20 19:56:52,547 INFO L137 Inliner]: procedures = 61, calls = 69, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 576 [2022-02-20 19:56:52,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:52,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:52,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:52,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:52,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:52,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:52,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:52,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:52,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (1/1) ... [2022-02-20 19:56:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:52,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:52,637 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:56:52,655 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:56:52,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:52,668 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:52,668 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:52,668 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:52,669 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:52,669 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:52,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:52,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:52,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:52,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:52,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:52,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:52,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:52,784 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:52,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:53,253 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:53,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:53,260 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:56:53,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:53 BoogieIcfgContainer [2022-02-20 19:56:53,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:53,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:53,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:53,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:53,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:52" (1/3) ... [2022-02-20 19:56:53,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8f5fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:53, skipping insertion in model container [2022-02-20 19:56:53,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:52" (2/3) ... [2022-02-20 19:56:53,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8f5fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:53, skipping insertion in model container [2022-02-20 19:56:53,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:53" (3/3) ... [2022-02-20 19:56:53,267 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.04.cil-1.c [2022-02-20 19:56:53,271 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:53,271 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:53,301 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:53,305 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:56:53,306 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 240 states have internal predecessors, (371), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 19:56:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:53,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:53,335 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:56:53,335 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1541344950, now seen corresponding path program 1 times [2022-02-20 19:56:53,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:53,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581933285] [2022-02-20 19:56:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(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); {327#(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:56:53,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {327#(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:56:53,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {288#(= ~q_write_ev~0 ~q_read_ev~0)} #988#return; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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); {328#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(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; {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {288#(= ~q_write_ev~0 ~q_read_ev~0)} #990#return; {287#false} is VALID [2022-02-20 19:56:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#true} havoc ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume 1 == ~p_dw_pc~0; {286#true} is VALID [2022-02-20 19:56:53,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {286#true} is VALID [2022-02-20 19:56:53,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#true} #res := ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,631 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {286#true} {286#true} #984#return; {286#true} is VALID [2022-02-20 19:56:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#true} havoc ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume !(1 == ~c_dr_pc~0); {286#true} is VALID [2022-02-20 19:56:53,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} ~__retres1~1 := 0; {286#true} is VALID [2022-02-20 19:56:53,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#true} #res := ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,637 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {286#true} {286#true} #986#return; {286#true} is VALID [2022-02-20 19:56:53,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(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; {286#true} is VALID [2022-02-20 19:56:53,637 INFO L272 TraceCheckUtils]: 1: Hoare triple {286#true} call #t~ret8 := is_do_write_p_triggered(); {286#true} is VALID [2022-02-20 19:56:53,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} havoc ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#true} assume 1 == ~p_dw_pc~0; {286#true} is VALID [2022-02-20 19:56:53,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {286#true} is VALID [2022-02-20 19:56:53,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#true} #res := ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,638 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {286#true} {286#true} #984#return; {286#true} is VALID [2022-02-20 19:56:53,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {286#true} is VALID [2022-02-20 19:56:53,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {286#true} is VALID [2022-02-20 19:56:53,639 INFO L272 TraceCheckUtils]: 10: Hoare triple {286#true} call #t~ret9 := is_do_read_c_triggered(); {286#true} is VALID [2022-02-20 19:56:53,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#true} havoc ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {286#true} assume !(1 == ~c_dr_pc~0); {286#true} is VALID [2022-02-20 19:56:53,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#true} ~__retres1~1 := 0; {286#true} is VALID [2022-02-20 19:56:53,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {286#true} #res := ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {286#true} {286#true} #986#return; {286#true} is VALID [2022-02-20 19:56:53,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {286#true} is VALID [2022-02-20 19:56:53,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {286#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {286#true} is VALID [2022-02-20 19:56:53,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,641 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {286#true} {287#false} #992#return; {287#false} is VALID [2022-02-20 19:56:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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; {286#true} is VALID [2022-02-20 19:56:53,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {286#true} is VALID [2022-02-20 19:56:53,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {287#false} #994#return; {287#false} is VALID [2022-02-20 19:56:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#true} havoc ~__retres1~2; {286#true} is VALID [2022-02-20 19:56:53,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {286#true} is VALID [2022-02-20 19:56:53,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} #res := ~__retres1~2; {286#true} is VALID [2022-02-20 19:56:53,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,653 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {286#true} {287#false} #996#return; {287#false} is VALID [2022-02-20 19:56:53,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {286#true} is VALID [2022-02-20 19:56:53,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {286#true} is VALID [2022-02-20 19:56:53,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {288#(= ~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; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {326#(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:56:53,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#(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); {327#(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:56:53,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {327#(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:56:53,657 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {288#(= ~q_write_ev~0 ~q_read_ev~0)} #988#return; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {288#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:53,659 INFO L272 TraceCheckUtils]: 12: Hoare triple {288#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {327#(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:56:53,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#(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); {328#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(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; {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:53,661 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {329#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {288#(= ~q_write_ev~0 ~q_read_ev~0)} #990#return; {287#false} is VALID [2022-02-20 19:56:53,661 INFO L272 TraceCheckUtils]: 17: Hoare triple {287#false} call activate_threads1(); {330#(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:56:53,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {330#(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; {286#true} is VALID [2022-02-20 19:56:53,661 INFO L272 TraceCheckUtils]: 19: Hoare triple {286#true} call #t~ret8 := is_do_write_p_triggered(); {286#true} is VALID [2022-02-20 19:56:53,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {286#true} havoc ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {286#true} assume 1 == ~p_dw_pc~0; {286#true} is VALID [2022-02-20 19:56:53,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {286#true} is VALID [2022-02-20 19:56:53,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#true} #res := ~__retres1~0; {286#true} is VALID [2022-02-20 19:56:53,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,662 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {286#true} {286#true} #984#return; {286#true} is VALID [2022-02-20 19:56:53,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {286#true} is VALID [2022-02-20 19:56:53,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {286#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {286#true} is VALID [2022-02-20 19:56:53,663 INFO L272 TraceCheckUtils]: 28: Hoare triple {286#true} call #t~ret9 := is_do_read_c_triggered(); {286#true} is VALID [2022-02-20 19:56:53,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {286#true} havoc ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {286#true} assume !(1 == ~c_dr_pc~0); {286#true} is VALID [2022-02-20 19:56:53,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {286#true} ~__retres1~1 := 0; {286#true} is VALID [2022-02-20 19:56:53,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {286#true} #res := ~__retres1~1; {286#true} is VALID [2022-02-20 19:56:53,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,664 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {286#true} {286#true} #986#return; {286#true} is VALID [2022-02-20 19:56:53,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {286#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {286#true} is VALID [2022-02-20 19:56:53,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {286#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {286#true} is VALID [2022-02-20 19:56:53,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,665 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {286#true} {287#false} #992#return; {287#false} is VALID [2022-02-20 19:56:53,665 INFO L272 TraceCheckUtils]: 39: Hoare triple {287#false} call reset_delta_events1(); {327#(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:56:53,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {327#(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; {286#true} is VALID [2022-02-20 19:56:53,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {286#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {286#true} is VALID [2022-02-20 19:56:53,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,666 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {286#true} {287#false} #994#return; {287#false} is VALID [2022-02-20 19:56:53,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 19:56:53,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {287#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; {287#false} is VALID [2022-02-20 19:56:53,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 19:56:53,694 INFO L272 TraceCheckUtils]: 47: Hoare triple {287#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {286#true} is VALID [2022-02-20 19:56:53,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {286#true} havoc ~__retres1~2; {286#true} is VALID [2022-02-20 19:56:53,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {286#true} is VALID [2022-02-20 19:56:53,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {286#true} #res := ~__retres1~2; {286#true} is VALID [2022-02-20 19:56:53,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {286#true} assume true; {286#true} is VALID [2022-02-20 19:56:53,696 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {286#true} {287#false} #996#return; {287#false} is VALID [2022-02-20 19:56:53,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {287#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; {287#false} is VALID [2022-02-20 19:56:53,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {287#false} assume 0 != eval1_~tmp___1~0#1; {287#false} is VALID [2022-02-20 19:56:53,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {287#false} assume !(0 == ~p_dw_st~0); {287#false} is VALID [2022-02-20 19:56:53,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {287#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; {287#false} is VALID [2022-02-20 19:56:53,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {287#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; {287#false} is VALID [2022-02-20 19:56:53,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {287#false} assume 0 == ~c_dr_pc~0; {287#false} is VALID [2022-02-20 19:56:53,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 19:56:53,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {287#false} assume !(1 == ~q_free~0); {287#false} is VALID [2022-02-20 19:56:53,698 INFO L290 TraceCheckUtils]: 61: Hoare triple {287#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; {287#false} is VALID [2022-02-20 19:56:53,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {287#false} assume !(~p_last_write~0 == ~c_last_read~0); {287#false} is VALID [2022-02-20 19:56:53,700 INFO L272 TraceCheckUtils]: 63: Hoare triple {287#false} call error1(); {287#false} is VALID [2022-02-20 19:56:53,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 19:56:53,702 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:56:53,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:53,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581933285] [2022-02-20 19:56:53,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581933285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:53,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:53,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:53,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686056685] [2022-02-20 19:56:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:53,712 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:56:53,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:53,717 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:56:53,772 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:56:53,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:53,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:53,797 INFO L87 Difference]: Start difference. First operand has 283 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 240 states have internal predecessors, (371), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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:56:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:56,706 INFO L93 Difference]: Finished difference Result 712 states and 1090 transitions. [2022-02-20 19:56:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:56:56,707 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:56:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:56,708 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:56:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1090 transitions. [2022-02-20 19:56:56,726 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:56:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1090 transitions. [2022-02-20 19:56:56,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1090 transitions. [2022-02-20 19:56:57,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1090 edges. 1090 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:57,593 INFO L225 Difference]: With dead ends: 712 [2022-02-20 19:56:57,593 INFO L226 Difference]: Without dead ends: 439 [2022-02-20 19:56:57,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:56:57,599 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 863 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:57,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 1678 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:56:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-02-20 19:56:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 373. [2022-02-20 19:56:57,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:57,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 439 states. Second operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:56:57,646 INFO L74 IsIncluded]: Start isIncluded. First operand 439 states. Second operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:56:57,647 INFO L87 Difference]: Start difference. First operand 439 states. Second operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:56:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:57,666 INFO L93 Difference]: Finished difference Result 439 states and 638 transitions. [2022-02-20 19:56:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 638 transitions. [2022-02-20 19:56:57,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:57,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:57,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 439 states. [2022-02-20 19:56:57,671 INFO L87 Difference]: Start difference. First operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 439 states. [2022-02-20 19:56:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:57,686 INFO L93 Difference]: Finished difference Result 439 states and 638 transitions. [2022-02-20 19:56:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 638 transitions. [2022-02-20 19:56:57,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:57,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:57,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:57,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 312 states have internal predecessors, (449), 43 states have call successors, (43), 21 states have call predecessors, (43), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:56:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 544 transitions. [2022-02-20 19:56:57,703 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 544 transitions. Word has length 65 [2022-02-20 19:56:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:57,703 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 544 transitions. [2022-02-20 19:56:57,704 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:56:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 544 transitions. [2022-02-20 19:56:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:57,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:57,706 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:56:57,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:57,706 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -487241160, now seen corresponding path program 1 times [2022-02-20 19:56:57,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:57,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468354857] [2022-02-20 19:56:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {2757#(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); {2758#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:57,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {2758#(not (= |old(~q_req_up~0)| 1))} assume true; {2758#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:57,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2758#(not (= |old(~q_req_up~0)| 1))} {2718#(= ~q_req_up~0 ~p_dw_pc~0)} #988#return; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {2759#(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); {2715#true} is VALID [2022-02-20 19:56:57,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume !(0 == ~q_write_ev~0); {2715#true} is VALID [2022-02-20 19:56:57,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2722#(not (= ~p_dw_pc~0 1))} #990#return; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#true} havoc ~__retres1~0; {2715#true} is VALID [2022-02-20 19:56:57,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume 1 == ~p_dw_pc~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,886 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} {2715#true} #984#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#true} havoc ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume !(1 == ~c_dr_pc~0); {2715#true} is VALID [2022-02-20 19:56:57,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} ~__retres1~1 := 0; {2715#true} is VALID [2022-02-20 19:56:57,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {2715#true} #res := ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,895 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2715#true} {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #986#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {2760#(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; {2715#true} is VALID [2022-02-20 19:56:57,895 INFO L272 TraceCheckUtils]: 1: Hoare triple {2715#true} call #t~ret8 := is_do_write_p_triggered(); {2715#true} is VALID [2022-02-20 19:56:57,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} havoc ~__retres1~0; {2715#true} is VALID [2022-02-20 19:56:57,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {2715#true} assume 1 == ~p_dw_pc~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,897 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} {2715#true} #984#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,898 INFO L272 TraceCheckUtils]: 10: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2715#true} is VALID [2022-02-20 19:56:57,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {2715#true} havoc ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {2715#true} assume !(1 == ~c_dr_pc~0); {2715#true} is VALID [2022-02-20 19:56:57,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {2715#true} ~__retres1~1 := 0; {2715#true} is VALID [2022-02-20 19:56:57,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2715#true} #res := ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,899 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2715#true} {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #986#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,901 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} {2722#(not (= ~p_dw_pc~0 1))} #992#return; {2716#false} is VALID [2022-02-20 19:56:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2759#(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; {2715#true} is VALID [2022-02-20 19:56:57,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2715#true} is VALID [2022-02-20 19:56:57,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2716#false} #994#return; {2716#false} is VALID [2022-02-20 19:56:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:57,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#true} havoc ~__retres1~2; {2715#true} is VALID [2022-02-20 19:56:57,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2715#true} is VALID [2022-02-20 19:56:57,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} #res := ~__retres1~2; {2715#true} is VALID [2022-02-20 19:56:57,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,919 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2715#true} {2716#false} #996#return; {2716#false} is VALID [2022-02-20 19:56:57,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2717#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:57,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {2717#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {2717#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:57,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2717#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {2718#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:56:57,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {2718#(= ~q_req_up~0 ~p_dw_pc~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; {2718#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:56:57,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {2757#(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:56:57,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {2757#(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); {2758#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:57,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {2758#(not (= |old(~q_req_up~0)| 1))} assume true; {2758#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:57,922 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2758#(not (= |old(~q_req_up~0)| 1))} {2718#(= ~q_req_up~0 ~p_dw_pc~0)} #988#return; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,923 INFO L272 TraceCheckUtils]: 12: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {2759#(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:56:57,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {2759#(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); {2715#true} is VALID [2022-02-20 19:56:57,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {2715#true} assume !(0 == ~q_write_ev~0); {2715#true} is VALID [2022-02-20 19:56:57,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2715#true} {2722#(not (= ~p_dw_pc~0 1))} #990#return; {2722#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:56:57,926 INFO L272 TraceCheckUtils]: 17: Hoare triple {2722#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {2760#(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:56:57,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {2760#(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; {2715#true} is VALID [2022-02-20 19:56:57,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {2715#true} call #t~ret8 := is_do_write_p_triggered(); {2715#true} is VALID [2022-02-20 19:56:57,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {2715#true} havoc ~__retres1~0; {2715#true} is VALID [2022-02-20 19:56:57,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {2715#true} assume 1 == ~p_dw_pc~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,929 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} {2715#true} #984#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,929 INFO L272 TraceCheckUtils]: 28: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {2715#true} havoc ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {2715#true} assume !(1 == ~c_dr_pc~0); {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {2715#true} ~__retres1~1 := 0; {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {2715#true} #res := ~__retres1~1; {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,930 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2715#true} {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} #986#return; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:56:57,935 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2767#(= (+ (- 1) ~p_dw_pc~0) 0)} {2722#(not (= ~p_dw_pc~0 1))} #992#return; {2716#false} is VALID [2022-02-20 19:56:57,935 INFO L272 TraceCheckUtils]: 39: Hoare triple {2716#false} call reset_delta_events1(); {2759#(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:56:57,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {2759#(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; {2715#true} is VALID [2022-02-20 19:56:57,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {2715#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2715#true} is VALID [2022-02-20 19:56:57,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,936 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2715#true} {2716#false} #994#return; {2716#false} is VALID [2022-02-20 19:56:57,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-02-20 19:56:57,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {2716#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; {2716#false} is VALID [2022-02-20 19:56:57,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-02-20 19:56:57,936 INFO L272 TraceCheckUtils]: 47: Hoare triple {2716#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2715#true} is VALID [2022-02-20 19:56:57,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {2715#true} havoc ~__retres1~2; {2715#true} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {2715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2715#true} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {2715#true} #res := ~__retres1~2; {2715#true} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-02-20 19:56:57,937 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2715#true} {2716#false} #996#return; {2716#false} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {2716#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; {2716#false} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {2716#false} assume 0 != eval1_~tmp___1~0#1; {2716#false} is VALID [2022-02-20 19:56:57,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {2716#false} assume !(0 == ~p_dw_st~0); {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {2716#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; {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {2716#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; {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {2716#false} assume 0 == ~c_dr_pc~0; {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {2716#false} assume !(1 == ~q_free~0); {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {2716#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; {2716#false} is VALID [2022-02-20 19:56:57,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {2716#false} assume !(~p_last_write~0 == ~c_last_read~0); {2716#false} is VALID [2022-02-20 19:56:57,939 INFO L272 TraceCheckUtils]: 63: Hoare triple {2716#false} call error1(); {2716#false} is VALID [2022-02-20 19:56:57,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-02-20 19:56:57,939 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:56:57,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:57,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468354857] [2022-02-20 19:56:57,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468354857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:57,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:57,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:56:57,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470067665] [2022-02-20 19:56:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:57,941 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:56:57,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:57,942 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:56:57,976 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:56:57,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:56:57,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:56:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:56:57,977 INFO L87 Difference]: Start difference. First operand 373 states and 544 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:57:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,673 INFO L93 Difference]: Finished difference Result 1320 states and 1873 transitions. [2022-02-20 19:57:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:02,673 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:57:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:02,674 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:57:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1086 transitions. [2022-02-20 19:57:02,694 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:57:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1086 transitions. [2022-02-20 19:57:02,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1086 transitions. [2022-02-20 19:57:03,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1086 edges. 1086 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:03,477 INFO L225 Difference]: With dead ends: 1320 [2022-02-20 19:57:03,478 INFO L226 Difference]: Without dead ends: 1127 [2022-02-20 19:57:03,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:57:03,484 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 2449 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:03,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2463 Valid, 1685 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:57:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-02-20 19:57:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1027. [2022-02-20 19:57:03,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:03,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1127 states. Second operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:57:03,550 INFO L74 IsIncluded]: Start isIncluded. First operand 1127 states. Second operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:57:03,554 INFO L87 Difference]: Start difference. First operand 1127 states. Second operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:57:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,596 INFO L93 Difference]: Finished difference Result 1127 states and 1528 transitions. [2022-02-20 19:57:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1528 transitions. [2022-02-20 19:57:03,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:03,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:03,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) Second operand 1127 states. [2022-02-20 19:57:03,604 INFO L87 Difference]: Start difference. First operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) Second operand 1127 states. [2022-02-20 19:57:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,647 INFO L93 Difference]: Finished difference Result 1127 states and 1528 transitions. [2022-02-20 19:57:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1528 transitions. [2022-02-20 19:57:03,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:03,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:03,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:03,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 821 states have (on average 1.405602923264312) internal successors, (1154), 841 states have internal predecessors, (1154), 110 states have call successors, (110), 81 states have call predecessors, (110), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:57:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1405 transitions. [2022-02-20 19:57:03,697 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1405 transitions. Word has length 65 [2022-02-20 19:57:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:03,697 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1405 transitions. [2022-02-20 19:57:03,698 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:57:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1405 transitions. [2022-02-20 19:57:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:03,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:03,699 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:03,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:03,700 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1762343849, now seen corresponding path program 1 times [2022-02-20 19:57:03,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:03,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376878389] [2022-02-20 19:57:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#(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); {8271#true} is VALID [2022-02-20 19:57:03,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8271#true} {8271#true} #988#return; {8271#true} is VALID [2022-02-20 19:57:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {8311#(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); {8271#true} is VALID [2022-02-20 19:57:03,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume !(0 == ~q_write_ev~0); {8271#true} is VALID [2022-02-20 19:57:03,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #990#return; {8271#true} is VALID [2022-02-20 19:57:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#true} havoc ~__retres1~0; {8271#true} is VALID [2022-02-20 19:57:03,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume !(1 == ~p_dw_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} ~__retres1~0 := 0; {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:03,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,875 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8271#true} #984#return; {8319#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#true} havoc ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume !(1 == ~c_dr_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} ~__retres1~1 := 0; {8271#true} is VALID [2022-02-20 19:57:03,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {8271#true} #res := ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,886 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8271#true} {8272#false} #986#return; {8272#false} is VALID [2022-02-20 19:57:03,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {8312#(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; {8271#true} is VALID [2022-02-20 19:57:03,886 INFO L272 TraceCheckUtils]: 1: Hoare triple {8271#true} call #t~ret8 := is_do_write_p_triggered(); {8271#true} is VALID [2022-02-20 19:57:03,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} havoc ~__retres1~0; {8271#true} is VALID [2022-02-20 19:57:03,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {8271#true} assume !(1 == ~p_dw_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {8271#true} ~__retres1~0 := 0; {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:03,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,889 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8271#true} #984#return; {8319#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:03,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {8319#(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; {8320#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:03,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {8320#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8272#false} is VALID [2022-02-20 19:57:03,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {8272#false} call #t~ret9 := is_do_read_c_triggered(); {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {8271#true} havoc ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {8271#true} assume !(1 == ~c_dr_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {8271#true} ~__retres1~1 := 0; {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {8271#true} #res := ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,893 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8271#true} {8272#false} #986#return; {8272#false} is VALID [2022-02-20 19:57:03,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {8272#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8272#false} is VALID [2022-02-20 19:57:03,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {8272#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8272#false} is VALID [2022-02-20 19:57:03,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {8272#false} assume true; {8272#false} is VALID [2022-02-20 19:57:03,894 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8272#false} {8271#true} #992#return; {8272#false} is VALID [2022-02-20 19:57:03,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {8311#(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; {8271#true} is VALID [2022-02-20 19:57:03,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8271#true} is VALID [2022-02-20 19:57:03,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8272#false} #994#return; {8272#false} is VALID [2022-02-20 19:57:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#true} havoc ~__retres1~2; {8271#true} is VALID [2022-02-20 19:57:03,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} #res := ~__retres1~2; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8271#true} {8272#false} #996#return; {8272#false} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {8271#true} is VALID [2022-02-20 19:57:03,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {8271#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; {8271#true} is VALID [2022-02-20 19:57:03,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call update_channels1(); {8310#(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:03,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {8310#(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); {8271#true} is VALID [2022-02-20 19:57:03,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,908 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8271#true} {8271#true} #988#return; {8271#true} is VALID [2022-02-20 19:57:03,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {8271#true} assume { :begin_inline_init_threads1 } true; {8271#true} is VALID [2022-02-20 19:57:03,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {8271#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8271#true} is VALID [2022-02-20 19:57:03,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {8271#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8271#true} is VALID [2022-02-20 19:57:03,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {8271#true} assume { :end_inline_init_threads1 } true; {8271#true} is VALID [2022-02-20 19:57:03,910 INFO L272 TraceCheckUtils]: 12: Hoare triple {8271#true} call fire_delta_events1(); {8311#(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:03,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {8311#(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); {8271#true} is VALID [2022-02-20 19:57:03,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {8271#true} assume !(0 == ~q_write_ev~0); {8271#true} is VALID [2022-02-20 19:57:03,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,911 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8271#true} {8271#true} #990#return; {8271#true} is VALID [2022-02-20 19:57:03,911 INFO L272 TraceCheckUtils]: 17: Hoare triple {8271#true} call activate_threads1(); {8312#(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:03,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {8312#(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; {8271#true} is VALID [2022-02-20 19:57:03,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {8271#true} call #t~ret8 := is_do_write_p_triggered(); {8271#true} is VALID [2022-02-20 19:57:03,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {8271#true} havoc ~__retres1~0; {8271#true} is VALID [2022-02-20 19:57:03,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {8271#true} assume !(1 == ~p_dw_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {8271#true} ~__retres1~0 := 0; {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:03,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {8327#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:03,913 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8328#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8271#true} #984#return; {8319#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:03,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {8319#(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; {8320#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:03,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {8320#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8272#false} is VALID [2022-02-20 19:57:03,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {8272#false} call #t~ret9 := is_do_read_c_triggered(); {8271#true} is VALID [2022-02-20 19:57:03,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {8271#true} havoc ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {8271#true} assume !(1 == ~c_dr_pc~0); {8271#true} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {8271#true} ~__retres1~1 := 0; {8271#true} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {8271#true} #res := ~__retres1~1; {8271#true} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,916 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8271#true} {8272#false} #986#return; {8272#false} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {8272#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8272#false} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {8272#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8272#false} is VALID [2022-02-20 19:57:03,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {8272#false} assume true; {8272#false} is VALID [2022-02-20 19:57:03,917 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8272#false} {8271#true} #992#return; {8272#false} is VALID [2022-02-20 19:57:03,917 INFO L272 TraceCheckUtils]: 39: Hoare triple {8272#false} call reset_delta_events1(); {8311#(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:03,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {8311#(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; {8271#true} is VALID [2022-02-20 19:57:03,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {8271#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8271#true} is VALID [2022-02-20 19:57:03,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,917 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8271#true} {8272#false} #994#return; {8272#false} is VALID [2022-02-20 19:57:03,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-02-20 19:57:03,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {8272#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; {8272#false} is VALID [2022-02-20 19:57:03,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-02-20 19:57:03,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {8272#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8271#true} is VALID [2022-02-20 19:57:03,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {8271#true} havoc ~__retres1~2; {8271#true} is VALID [2022-02-20 19:57:03,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {8271#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8271#true} is VALID [2022-02-20 19:57:03,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {8271#true} #res := ~__retres1~2; {8271#true} is VALID [2022-02-20 19:57:03,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-02-20 19:57:03,923 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8271#true} {8272#false} #996#return; {8272#false} is VALID [2022-02-20 19:57:03,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {8272#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; {8272#false} is VALID [2022-02-20 19:57:03,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {8272#false} assume 0 != eval1_~tmp___1~0#1; {8272#false} is VALID [2022-02-20 19:57:03,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {8272#false} assume !(0 == ~p_dw_st~0); {8272#false} is VALID [2022-02-20 19:57:03,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {8272#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; {8272#false} is VALID [2022-02-20 19:57:03,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {8272#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; {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {8272#false} assume 0 == ~c_dr_pc~0; {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {8272#false} assume !(1 == ~q_free~0); {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {8272#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; {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {8272#false} assume !(~p_last_write~0 == ~c_last_read~0); {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L272 TraceCheckUtils]: 63: Hoare triple {8272#false} call error1(); {8272#false} is VALID [2022-02-20 19:57:03,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-02-20 19:57:03,926 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:03,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:03,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376878389] [2022-02-20 19:57:03,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376878389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:03,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:03,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:03,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650396607] [2022-02-20 19:57:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:03,927 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:57:03,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:03,928 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:57:03,970 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:03,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:03,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:03,971 INFO L87 Difference]: Start difference. First operand 1027 states and 1405 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:57:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,329 INFO L93 Difference]: Finished difference Result 1937 states and 2621 transitions. [2022-02-20 19:57:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:06,329 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:57:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:06,330 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:57:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 552 transitions. [2022-02-20 19:57:06,334 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:57:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 552 transitions. [2022-02-20 19:57:06,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 552 transitions. [2022-02-20 19:57:06,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:06,769 INFO L225 Difference]: With dead ends: 1937 [2022-02-20 19:57:06,769 INFO L226 Difference]: Without dead ends: 1097 [2022-02-20 19:57:06,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:06,771 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 487 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:06,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 1559 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-02-20 19:57:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1047. [2022-02-20 19:57:06,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:06,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1097 states. Second operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:57:06,840 INFO L74 IsIncluded]: Start isIncluded. First operand 1097 states. Second operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:57:06,842 INFO L87 Difference]: Start difference. First operand 1097 states. Second operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:57:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,880 INFO L93 Difference]: Finished difference Result 1097 states and 1479 transitions. [2022-02-20 19:57:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1479 transitions. [2022-02-20 19:57:06,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) Second operand 1097 states. [2022-02-20 19:57:06,888 INFO L87 Difference]: Start difference. First operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) Second operand 1097 states. [2022-02-20 19:57:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,926 INFO L93 Difference]: Finished difference Result 1097 states and 1479 transitions. [2022-02-20 19:57:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1479 transitions. [2022-02-20 19:57:06,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:06,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 837 states have (on average 1.3906810035842294) internal successors, (1164), 857 states have internal predecessors, (1164), 110 states have call successors, (110), 81 states have call predecessors, (110), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:57:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1419 transitions. [2022-02-20 19:57:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1419 transitions. Word has length 65 [2022-02-20 19:57:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:06,976 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 1419 transitions. [2022-02-20 19:57:06,977 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:57:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1419 transitions. [2022-02-20 19:57:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:06,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:06,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:57:06,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:06,980 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1503264149, now seen corresponding path program 1 times [2022-02-20 19:57:06,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:06,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770667038] [2022-02-20 19:57:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {14601#(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); {14562#true} is VALID [2022-02-20 19:57:07,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14562#true} {14562#true} #988#return; {14562#true} is VALID [2022-02-20 19:57:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {14602#(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); {14562#true} is VALID [2022-02-20 19:57:07,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(0 == ~q_write_ev~0); {14562#true} is VALID [2022-02-20 19:57:07,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14562#true} {14562#true} #990#return; {14562#true} is VALID [2022-02-20 19:57:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} havoc ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(1 == ~p_dw_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} ~__retres1~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {14562#true} #res := ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,097 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14562#true} {14562#true} #984#return; {14562#true} is VALID [2022-02-20 19:57:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} havoc ~__retres1~1; {14562#true} is VALID [2022-02-20 19:57:07,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(1 == ~c_dr_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} ~__retres1~1 := 0; {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:07,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,126 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14562#true} #986#return; {14616#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:07,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {14603#(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; {14562#true} is VALID [2022-02-20 19:57:07,126 INFO L272 TraceCheckUtils]: 1: Hoare triple {14562#true} call #t~ret8 := is_do_write_p_triggered(); {14562#true} is VALID [2022-02-20 19:57:07,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} havoc ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {14562#true} assume !(1 == ~p_dw_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {14562#true} ~__retres1~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {14562#true} #res := ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14562#true} {14562#true} #984#return; {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {14562#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {14562#true} assume !(0 != ~tmp~1); {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L272 TraceCheckUtils]: 10: Hoare triple {14562#true} call #t~ret9 := is_do_read_c_triggered(); {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {14562#true} havoc ~__retres1~1; {14562#true} is VALID [2022-02-20 19:57:07,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {14562#true} assume !(1 == ~c_dr_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {14562#true} ~__retres1~1 := 0; {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:07,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,132 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14562#true} #986#return; {14616#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:07,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {14616#(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; {14617#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:07,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {14617#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14563#false} is VALID [2022-02-20 19:57:07,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {14563#false} assume true; {14563#false} is VALID [2022-02-20 19:57:07,133 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14563#false} {14562#true} #992#return; {14563#false} is VALID [2022-02-20 19:57:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {14602#(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; {14562#true} is VALID [2022-02-20 19:57:07,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14562#true} is VALID [2022-02-20 19:57:07,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14562#true} {14563#false} #994#return; {14563#false} is VALID [2022-02-20 19:57:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} havoc ~__retres1~2; {14562#true} is VALID [2022-02-20 19:57:07,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14562#true} is VALID [2022-02-20 19:57:07,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} #res := ~__retres1~2; {14562#true} is VALID [2022-02-20 19:57:07,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,142 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14562#true} {14563#false} #996#return; {14563#false} is VALID [2022-02-20 19:57:07,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {14562#true} is VALID [2022-02-20 19:57:07,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {14562#true} is VALID [2022-02-20 19:57:07,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {14562#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; {14562#true} is VALID [2022-02-20 19:57:07,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {14562#true} call update_channels1(); {14601#(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:07,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {14601#(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); {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14562#true} {14562#true} #988#return; {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {14562#true} assume { :begin_inline_init_threads1 } true; {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {14562#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {14562#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {14562#true} assume { :end_inline_init_threads1 } true; {14562#true} is VALID [2022-02-20 19:57:07,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {14562#true} call fire_delta_events1(); {14602#(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:07,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {14602#(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); {14562#true} is VALID [2022-02-20 19:57:07,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {14562#true} assume !(0 == ~q_write_ev~0); {14562#true} is VALID [2022-02-20 19:57:07,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14562#true} {14562#true} #990#return; {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {14562#true} call activate_threads1(); {14603#(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:07,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {14603#(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; {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L272 TraceCheckUtils]: 19: Hoare triple {14562#true} call #t~ret8 := is_do_write_p_triggered(); {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {14562#true} havoc ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {14562#true} assume !(1 == ~p_dw_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {14562#true} ~__retres1~0 := 0; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {14562#true} #res := ~__retres1~0; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14562#true} {14562#true} #984#return; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {14562#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {14562#true} assume !(0 != ~tmp~1); {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {14562#true} call #t~ret9 := is_do_read_c_triggered(); {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {14562#true} havoc ~__retres1~1; {14562#true} is VALID [2022-02-20 19:57:07,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {14562#true} assume !(1 == ~c_dr_pc~0); {14562#true} is VALID [2022-02-20 19:57:07,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {14562#true} ~__retres1~1 := 0; {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:07,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {14618#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:07,153 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14619#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14562#true} #986#return; {14616#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:07,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {14616#(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; {14617#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:07,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {14617#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14563#false} is VALID [2022-02-20 19:57:07,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {14563#false} assume true; {14563#false} is VALID [2022-02-20 19:57:07,154 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14563#false} {14562#true} #992#return; {14563#false} is VALID [2022-02-20 19:57:07,154 INFO L272 TraceCheckUtils]: 39: Hoare triple {14563#false} call reset_delta_events1(); {14602#(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:07,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {14602#(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; {14562#true} is VALID [2022-02-20 19:57:07,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {14562#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14562#true} is VALID [2022-02-20 19:57:07,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,154 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14562#true} {14563#false} #994#return; {14563#false} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {14563#false} assume !false; {14563#false} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {14563#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; {14563#false} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {14563#false} assume !false; {14563#false} is VALID [2022-02-20 19:57:07,155 INFO L272 TraceCheckUtils]: 47: Hoare triple {14563#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14562#true} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {14562#true} havoc ~__retres1~2; {14562#true} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {14562#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14562#true} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {14562#true} #res := ~__retres1~2; {14562#true} is VALID [2022-02-20 19:57:07,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-02-20 19:57:07,156 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14562#true} {14563#false} #996#return; {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {14563#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; {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {14563#false} assume 0 != eval1_~tmp___1~0#1; {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {14563#false} assume !(0 == ~p_dw_st~0); {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {14563#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; {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {14563#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; {14563#false} is VALID [2022-02-20 19:57:07,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {14563#false} assume 0 == ~c_dr_pc~0; {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {14563#false} assume !false; {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {14563#false} assume !(1 == ~q_free~0); {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {14563#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; {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {14563#false} assume !(~p_last_write~0 == ~c_last_read~0); {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L272 TraceCheckUtils]: 63: Hoare triple {14563#false} call error1(); {14563#false} is VALID [2022-02-20 19:57:07,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {14563#false} assume !false; {14563#false} is VALID [2022-02-20 19:57:07,157 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:07,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:07,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770667038] [2022-02-20 19:57:07,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770667038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:07,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:07,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:07,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985628597] [2022-02-20 19:57:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:07,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:57:07,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:07,159 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:57:07,191 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:07,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:07,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:07,192 INFO L87 Difference]: Start difference. First operand 1047 states and 1419 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:57:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,533 INFO L93 Difference]: Finished difference Result 2015 states and 2701 transitions. [2022-02-20 19:57:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:09,534 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:57:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:09,534 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:57:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 556 transitions. [2022-02-20 19:57:09,538 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:57:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 556 transitions. [2022-02-20 19:57:09,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 556 transitions. [2022-02-20 19:57:09,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:09,949 INFO L225 Difference]: With dead ends: 2015 [2022-02-20 19:57:09,949 INFO L226 Difference]: Without dead ends: 1155 [2022-02-20 19:57:09,951 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:57:09,952 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 329 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:09,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1729 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-02-20 19:57:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1097. [2022-02-20 19:57:10,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:10,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1155 states. Second operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:57:10,009 INFO L74 IsIncluded]: Start isIncluded. First operand 1155 states. Second operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:57:10,011 INFO L87 Difference]: Start difference. First operand 1155 states. Second operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:57:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,050 INFO L93 Difference]: Finished difference Result 1155 states and 1541 transitions. [2022-02-20 19:57:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1541 transitions. [2022-02-20 19:57:10,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) Second operand 1155 states. [2022-02-20 19:57:10,057 INFO L87 Difference]: Start difference. First operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) Second operand 1155 states. [2022-02-20 19:57:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,097 INFO L93 Difference]: Finished difference Result 1155 states and 1541 transitions. [2022-02-20 19:57:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1541 transitions. [2022-02-20 19:57:10,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:10,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 877 states have (on average 1.3728620296465222) internal successors, (1204), 897 states have internal predecessors, (1204), 110 states have call successors, (110), 81 states have call predecessors, (110), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:57:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1469 transitions. [2022-02-20 19:57:10,148 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1469 transitions. Word has length 65 [2022-02-20 19:57:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:10,149 INFO L470 AbstractCegarLoop]: Abstraction has 1097 states and 1469 transitions. [2022-02-20 19:57:10,149 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:57:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1469 transitions. [2022-02-20 19:57:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:10,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:10,150 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:10,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:10,150 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1405499753, now seen corresponding path program 1 times [2022-02-20 19:57:10,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:10,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252687014] [2022-02-20 19:57:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {21163#(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); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21125#(= ~q_read_ev~0 2)} #988#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {21165#(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); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21125#(= ~q_read_ev~0 2)} #990#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {21123#true} havoc ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {21123#true} assume !(1 == ~p_dw_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {21123#true} ~__retres1~0 := 0; {21123#true} is VALID [2022-02-20 19:57:10,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {21123#true} #res := ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,241 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21123#true} {21123#true} #984#return; {21123#true} is VALID [2022-02-20 19:57:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {21123#true} havoc ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {21123#true} assume !(1 == ~c_dr_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {21123#true} ~__retres1~1 := 0; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {21123#true} #res := ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21123#true} {21123#true} #986#return; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {21166#(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; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L272 TraceCheckUtils]: 1: Hoare triple {21123#true} call #t~ret8 := is_do_write_p_triggered(); {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {21123#true} havoc ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {21123#true} assume !(1 == ~p_dw_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {21123#true} ~__retres1~0 := 0; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {21123#true} #res := ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21123#true} {21123#true} #984#return; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {21123#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {21123#true} assume !(0 != ~tmp~1); {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L272 TraceCheckUtils]: 10: Hoare triple {21123#true} call #t~ret9 := is_do_read_c_triggered(); {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {21123#true} havoc ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {21123#true} assume !(1 == ~c_dr_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {21123#true} ~__retres1~1 := 0; {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {21123#true} #res := ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21123#true} {21123#true} #986#return; {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {21123#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21123#true} is VALID [2022-02-20 19:57:10,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {21123#true} assume !(0 != ~tmp___0~1); {21123#true} is VALID [2022-02-20 19:57:10,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,248 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21123#true} {21125#(= ~q_read_ev~0 2)} #992#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {21165#(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; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {21179#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {21179#(= |old(~q_read_ev~0)| 1)} assume true; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21179#(= |old(~q_read_ev~0)| 1)} {21125#(= ~q_read_ev~0 2)} #994#return; {21124#false} is VALID [2022-02-20 19:57:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {21123#true} havoc ~__retres1~2; {21123#true} is VALID [2022-02-20 19:57:10,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {21123#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21123#true} is VALID [2022-02-20 19:57:10,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {21123#true} #res := ~__retres1~2; {21123#true} is VALID [2022-02-20 19:57:10,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,263 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21123#true} {21124#false} #996#return; {21124#false} is VALID [2022-02-20 19:57:10,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {21123#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {21123#true} is VALID [2022-02-20 19:57:10,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {21123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {21123#true} is VALID [2022-02-20 19:57:10,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {21123#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {21125#(= ~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; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {21125#(= ~q_read_ev~0 2)} call update_channels1(); {21163#(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:10,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {21163#(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); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,265 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21125#(= ~q_read_ev~0 2)} #988#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {21125#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {21125#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {21125#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {21125#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {21125#(= ~q_read_ev~0 2)} call fire_delta_events1(); {21165#(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:10,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {21165#(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); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:10,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21164#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21125#(= ~q_read_ev~0 2)} #990#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,268 INFO L272 TraceCheckUtils]: 17: Hoare triple {21125#(= ~q_read_ev~0 2)} call activate_threads1(); {21166#(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:10,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {21166#(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; {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {21123#true} call #t~ret8 := is_do_write_p_triggered(); {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {21123#true} havoc ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {21123#true} assume !(1 == ~p_dw_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {21123#true} ~__retres1~0 := 0; {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {21123#true} #res := ~__retres1~0; {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,269 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21123#true} {21123#true} #984#return; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {21123#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {21123#true} assume !(0 != ~tmp~1); {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {21123#true} call #t~ret9 := is_do_read_c_triggered(); {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {21123#true} havoc ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {21123#true} assume !(1 == ~c_dr_pc~0); {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {21123#true} ~__retres1~1 := 0; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {21123#true} #res := ~__retres1~1; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21123#true} {21123#true} #986#return; {21123#true} is VALID [2022-02-20 19:57:10,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {21123#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21123#true} is VALID [2022-02-20 19:57:10,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {21123#true} assume !(0 != ~tmp___0~1); {21123#true} is VALID [2022-02-20 19:57:10,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,271 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21123#true} {21125#(= ~q_read_ev~0 2)} #992#return; {21125#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:10,272 INFO L272 TraceCheckUtils]: 39: Hoare triple {21125#(= ~q_read_ev~0 2)} call reset_delta_events1(); {21165#(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:10,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {21165#(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; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {21179#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {21179#(= |old(~q_read_ev~0)| 1)} assume true; {21179#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 19:57:10,273 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21179#(= |old(~q_read_ev~0)| 1)} {21125#(= ~q_read_ev~0 2)} #994#return; {21124#false} is VALID [2022-02-20 19:57:10,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {21124#false} assume !false; {21124#false} is VALID [2022-02-20 19:57:10,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {21124#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; {21124#false} is VALID [2022-02-20 19:57:10,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {21124#false} assume !false; {21124#false} is VALID [2022-02-20 19:57:10,273 INFO L272 TraceCheckUtils]: 47: Hoare triple {21124#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21123#true} is VALID [2022-02-20 19:57:10,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {21123#true} havoc ~__retres1~2; {21123#true} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {21123#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21123#true} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {21123#true} #res := ~__retres1~2; {21123#true} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {21123#true} assume true; {21123#true} is VALID [2022-02-20 19:57:10,274 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21123#true} {21124#false} #996#return; {21124#false} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {21124#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; {21124#false} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {21124#false} assume 0 != eval1_~tmp___1~0#1; {21124#false} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {21124#false} assume !(0 == ~p_dw_st~0); {21124#false} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {21124#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; {21124#false} is VALID [2022-02-20 19:57:10,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {21124#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; {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {21124#false} assume 0 == ~c_dr_pc~0; {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {21124#false} assume !false; {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {21124#false} assume !(1 == ~q_free~0); {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {21124#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; {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {21124#false} assume !(~p_last_write~0 == ~c_last_read~0); {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L272 TraceCheckUtils]: 63: Hoare triple {21124#false} call error1(); {21124#false} is VALID [2022-02-20 19:57:10,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {21124#false} assume !false; {21124#false} is VALID [2022-02-20 19:57:10,276 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:10,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:10,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252687014] [2022-02-20 19:57:10,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252687014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:10,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:10,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:10,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201600236] [2022-02-20 19:57:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:10,278 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:10,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:10,278 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:10,310 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:10,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:10,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:10,311 INFO L87 Difference]: Start difference. First operand 1097 states and 1469 transitions. 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:57:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,263 INFO L93 Difference]: Finished difference Result 2234 states and 2952 transitions. [2022-02-20 19:57:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:57:12,263 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:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:12,263 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:57:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 708 transitions. [2022-02-20 19:57:12,268 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:57:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 708 transitions. [2022-02-20 19:57:12,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 708 transitions. [2022-02-20 19:57:12,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:12,800 INFO L225 Difference]: With dead ends: 2234 [2022-02-20 19:57:12,801 INFO L226 Difference]: Without dead ends: 1562 [2022-02-20 19:57:12,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:57:12,802 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 977 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:12,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [981 Valid, 1145 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:57:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-02-20 19:57:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1434. [2022-02-20 19:57:12,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:12,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1562 states. Second operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) [2022-02-20 19:57:12,877 INFO L74 IsIncluded]: Start isIncluded. First operand 1562 states. Second operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) [2022-02-20 19:57:12,879 INFO L87 Difference]: Start difference. First operand 1562 states. Second operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) [2022-02-20 19:57:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,948 INFO L93 Difference]: Finished difference Result 1562 states and 2023 transitions. [2022-02-20 19:57:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2023 transitions. [2022-02-20 19:57:12,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:12,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:12,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) Second operand 1562 states. [2022-02-20 19:57:12,955 INFO L87 Difference]: Start difference. First operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) Second operand 1562 states. [2022-02-20 19:57:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,024 INFO L93 Difference]: Finished difference Result 1562 states and 2023 transitions. [2022-02-20 19:57:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2023 transitions. [2022-02-20 19:57:13,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1148 states have (on average 1.343205574912892) internal successors, (1542), 1171 states have internal predecessors, (1542), 142 states have call successors, (142), 111 states have call predecessors, (142), 142 states have return successors, (192), 154 states have call predecessors, (192), 140 states have call successors, (192) [2022-02-20 19:57:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1876 transitions. [2022-02-20 19:57:13,113 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1876 transitions. Word has length 65 [2022-02-20 19:57:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,113 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1876 transitions. [2022-02-20 19:57:13,113 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:57:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1876 transitions. [2022-02-20 19:57:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:13,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,114 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:13,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:13,114 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1264951143, now seen corresponding path program 1 times [2022-02-20 19:57:13,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821584107] [2022-02-20 19:57:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {29282#(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); {29283#(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:13,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29283#(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:13,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #988#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {29283#(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); {29283#(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:13,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {29283#(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); {29283#(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:13,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29283#(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:13,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #990#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {29242#true} havoc ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {29242#true} assume !(1 == ~p_dw_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {29242#true} ~__retres1~0 := 0; {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {29242#true} #res := ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29242#true} {29242#true} #984#return; {29242#true} is VALID [2022-02-20 19:57:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {29242#true} havoc ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {29242#true} assume !(1 == ~c_dr_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {29242#true} ~__retres1~1 := 0; {29242#true} is VALID [2022-02-20 19:57:13,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {29242#true} #res := ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29242#true} {29242#true} #986#return; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {29284#(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; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L272 TraceCheckUtils]: 1: Hoare triple {29242#true} call #t~ret8 := is_do_write_p_triggered(); {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {29242#true} havoc ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {29242#true} assume !(1 == ~p_dw_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {29242#true} ~__retres1~0 := 0; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {29242#true} #res := ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29242#true} {29242#true} #984#return; {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {29242#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {29242#true} assume !(0 != ~tmp~1); {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L272 TraceCheckUtils]: 10: Hoare triple {29242#true} call #t~ret9 := is_do_read_c_triggered(); {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {29242#true} havoc ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {29242#true} assume !(1 == ~c_dr_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {29242#true} ~__retres1~1 := 0; {29242#true} is VALID [2022-02-20 19:57:13,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {29242#true} #res := ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29242#true} {29242#true} #986#return; {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {29242#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {29242#true} assume !(0 != ~tmp___0~1); {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,199 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29242#true} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #992#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {29283#(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); {29297#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {29297#(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; {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #994#return; {29243#false} is VALID [2022-02-20 19:57:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {29242#true} havoc ~__retres1~2; {29242#true} is VALID [2022-02-20 19:57:13,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {29242#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29242#true} is VALID [2022-02-20 19:57:13,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {29242#true} #res := ~__retres1~2; {29242#true} is VALID [2022-02-20 19:57:13,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,222 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29242#true} {29243#false} #996#return; {29243#false} is VALID [2022-02-20 19:57:13,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {29242#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {29242#true} is VALID [2022-02-20 19:57:13,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {29242#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {29242#true} is VALID [2022-02-20 19:57:13,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {29242#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {29244#(= ~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; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29282#(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:13,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {29282#(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); {29283#(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:13,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29283#(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:13,225 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #988#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29283#(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:13,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {29283#(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); {29283#(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:13,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {29283#(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); {29283#(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:13,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29283#(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:13,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #990#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29284#(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:13,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {29284#(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; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {29242#true} call #t~ret8 := is_do_write_p_triggered(); {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {29242#true} havoc ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {29242#true} assume !(1 == ~p_dw_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {29242#true} ~__retres1~0 := 0; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {29242#true} #res := ~__retres1~0; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29242#true} {29242#true} #984#return; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {29242#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29242#true} is VALID [2022-02-20 19:57:13,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {29242#true} assume !(0 != ~tmp~1); {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {29242#true} call #t~ret9 := is_do_read_c_triggered(); {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {29242#true} havoc ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {29242#true} assume !(1 == ~c_dr_pc~0); {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {29242#true} ~__retres1~1 := 0; {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {29242#true} #res := ~__retres1~1; {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29242#true} {29242#true} #986#return; {29242#true} is VALID [2022-02-20 19:57:13,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {29242#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29242#true} is VALID [2022-02-20 19:57:13,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {29242#true} assume !(0 != ~tmp___0~1); {29242#true} is VALID [2022-02-20 19:57:13,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,231 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29242#true} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #992#return; {29244#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {29244#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29283#(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:13,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {29283#(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); {29297#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:13,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {29297#(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; {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,233 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29298#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29244#(= ~q_write_ev~0 ~q_read_ev~0)} #994#return; {29243#false} is VALID [2022-02-20 19:57:13,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {29243#false} assume !false; {29243#false} is VALID [2022-02-20 19:57:13,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {29243#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; {29243#false} is VALID [2022-02-20 19:57:13,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {29243#false} assume !false; {29243#false} is VALID [2022-02-20 19:57:13,233 INFO L272 TraceCheckUtils]: 47: Hoare triple {29243#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29242#true} is VALID [2022-02-20 19:57:13,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {29242#true} havoc ~__retres1~2; {29242#true} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {29242#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29242#true} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {29242#true} #res := ~__retres1~2; {29242#true} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {29242#true} assume true; {29242#true} is VALID [2022-02-20 19:57:13,234 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29242#true} {29243#false} #996#return; {29243#false} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {29243#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; {29243#false} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {29243#false} assume 0 != eval1_~tmp___1~0#1; {29243#false} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {29243#false} assume !(0 == ~p_dw_st~0); {29243#false} is VALID [2022-02-20 19:57:13,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {29243#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; {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {29243#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; {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {29243#false} assume 0 == ~c_dr_pc~0; {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {29243#false} assume !false; {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {29243#false} assume !(1 == ~q_free~0); {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {29243#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; {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {29243#false} assume !(~p_last_write~0 == ~c_last_read~0); {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L272 TraceCheckUtils]: 63: Hoare triple {29243#false} call error1(); {29243#false} is VALID [2022-02-20 19:57:13,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {29243#false} assume !false; {29243#false} is VALID [2022-02-20 19:57:13,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:57:13,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821584107] [2022-02-20 19:57:13,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821584107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:13,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167290129] [2022-02-20 19:57:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,237 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:57:13,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,237 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:57:13,268 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:13,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:13,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:13,270 INFO L87 Difference]: Start difference. First operand 1434 states and 1876 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:57:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:15,605 INFO L93 Difference]: Finished difference Result 2510 states and 3239 transitions. [2022-02-20 19:57:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:15,606 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:57:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:15,606 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:57:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 713 transitions. [2022-02-20 19:57:15,613 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:57:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 713 transitions. [2022-02-20 19:57:15,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 713 transitions. [2022-02-20 19:57:16,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 713 edges. 713 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:16,148 INFO L225 Difference]: With dead ends: 2510 [2022-02-20 19:57:16,148 INFO L226 Difference]: Without dead ends: 1501 [2022-02-20 19:57:16,149 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:57:16,151 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 791 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:16,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [814 Valid, 1353 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2022-02-20 19:57:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1341. [2022-02-20 19:57:16,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:16,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1501 states. Second operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) [2022-02-20 19:57:16,218 INFO L74 IsIncluded]: Start isIncluded. First operand 1501 states. Second operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) [2022-02-20 19:57:16,219 INFO L87 Difference]: Start difference. First operand 1501 states. Second operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) [2022-02-20 19:57:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,276 INFO L93 Difference]: Finished difference Result 1501 states and 1931 transitions. [2022-02-20 19:57:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1931 transitions. [2022-02-20 19:57:16,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) Second operand 1501 states. [2022-02-20 19:57:16,282 INFO L87 Difference]: Start difference. First operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) Second operand 1501 states. [2022-02-20 19:57:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,339 INFO L93 Difference]: Finished difference Result 1501 states and 1931 transitions. [2022-02-20 19:57:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1931 transitions. [2022-02-20 19:57:16,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:16,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1078 states have (on average 1.342300556586271) internal successors, (1447), 1096 states have internal predecessors, (1447), 134 states have call successors, (134), 104 states have call predecessors, (134), 127 states have return successors, (170), 142 states have call predecessors, (170), 132 states have call successors, (170) [2022-02-20 19:57:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1751 transitions. [2022-02-20 19:57:16,410 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1751 transitions. Word has length 65 [2022-02-20 19:57:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:16,410 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 1751 transitions. [2022-02-20 19:57:16,411 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:57:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1751 transitions. [2022-02-20 19:57:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:16,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:16,411 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:16,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:16,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1398964649, now seen corresponding path program 1 times [2022-02-20 19:57:16,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:16,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831176246] [2022-02-20 19:57:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {37536#(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); {37496#true} is VALID [2022-02-20 19:57:16,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37496#true} {37496#true} #988#return; {37496#true} is VALID [2022-02-20 19:57:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {37537#(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); {37496#true} is VALID [2022-02-20 19:57:16,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume !(0 == ~q_write_ev~0); {37496#true} is VALID [2022-02-20 19:57:16,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37496#true} {37501#(= ~p_dw_st~0 0)} #990#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {37496#true} havoc ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume !(1 == ~p_dw_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} ~__retres1~0 := 0; {37496#true} is VALID [2022-02-20 19:57:16,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {37496#true} #res := ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,471 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #984#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {37496#true} havoc ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume !(1 == ~c_dr_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} ~__retres1~1 := 0; {37496#true} is VALID [2022-02-20 19:57:16,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {37496#true} #res := ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,478 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #986#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {37538#(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; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,478 INFO L272 TraceCheckUtils]: 1: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {37496#true} is VALID [2022-02-20 19:57:16,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} havoc ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {37496#true} assume !(1 == ~p_dw_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {37496#true} ~__retres1~0 := 0; {37496#true} is VALID [2022-02-20 19:57:16,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {37496#true} #res := ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,479 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #984#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,480 INFO L272 TraceCheckUtils]: 10: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {37496#true} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {37496#true} havoc ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {37496#true} assume !(1 == ~c_dr_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {37496#true} ~__retres1~1 := 0; {37496#true} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {37496#true} #res := ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,481 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #986#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,482 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {37501#(= ~p_dw_st~0 0)} #992#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {37537#(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); {37496#true} is VALID [2022-02-20 19:57:16,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume !(1 == ~q_write_ev~0); {37496#true} is VALID [2022-02-20 19:57:16,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37496#true} {37501#(= ~p_dw_st~0 0)} #994#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {37496#true} havoc ~__retres1~2; {37496#true} is VALID [2022-02-20 19:57:16,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {37501#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {37501#(= ~p_dw_st~0 0)} assume true; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,505 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37501#(= ~p_dw_st~0 0)} {37501#(= ~p_dw_st~0 0)} #996#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {37496#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {37496#true} is VALID [2022-02-20 19:57:16,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {37496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {37496#true} is VALID [2022-02-20 19:57:16,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {37496#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {37496#true} is VALID [2022-02-20 19:57:16,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {37496#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; {37496#true} is VALID [2022-02-20 19:57:16,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {37496#true} call update_channels1(); {37536#(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:16,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {37536#(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); {37496#true} is VALID [2022-02-20 19:57:16,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,507 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37496#true} {37496#true} #988#return; {37496#true} is VALID [2022-02-20 19:57:16,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {37496#true} assume { :begin_inline_init_threads1 } true; {37496#true} is VALID [2022-02-20 19:57:16,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {37496#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {37501#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {37501#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,508 INFO L272 TraceCheckUtils]: 12: Hoare triple {37501#(= ~p_dw_st~0 0)} call fire_delta_events1(); {37537#(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:16,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {37537#(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); {37496#true} is VALID [2022-02-20 19:57:16,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {37496#true} assume !(0 == ~q_write_ev~0); {37496#true} is VALID [2022-02-20 19:57:16,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,509 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37496#true} {37501#(= ~p_dw_st~0 0)} #990#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,515 INFO L272 TraceCheckUtils]: 17: Hoare triple {37501#(= ~p_dw_st~0 0)} call activate_threads1(); {37538#(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:16,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {37538#(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; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,515 INFO L272 TraceCheckUtils]: 19: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {37496#true} is VALID [2022-02-20 19:57:16,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {37496#true} havoc ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {37496#true} assume !(1 == ~p_dw_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {37496#true} ~__retres1~0 := 0; {37496#true} is VALID [2022-02-20 19:57:16,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {37496#true} #res := ~__retres1~0; {37496#true} is VALID [2022-02-20 19:57:16,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,516 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #984#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,518 INFO L272 TraceCheckUtils]: 28: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {37496#true} is VALID [2022-02-20 19:57:16,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {37496#true} havoc ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {37496#true} assume !(1 == ~c_dr_pc~0); {37496#true} is VALID [2022-02-20 19:57:16,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {37496#true} ~__retres1~1 := 0; {37496#true} is VALID [2022-02-20 19:57:16,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {37496#true} #res := ~__retres1~1; {37496#true} is VALID [2022-02-20 19:57:16,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,519 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {37496#true} {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #986#return; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,520 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {37539#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {37501#(= ~p_dw_st~0 0)} #992#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,521 INFO L272 TraceCheckUtils]: 39: Hoare triple {37501#(= ~p_dw_st~0 0)} call reset_delta_events1(); {37537#(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:16,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {37537#(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); {37496#true} is VALID [2022-02-20 19:57:16,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {37496#true} assume !(1 == ~q_write_ev~0); {37496#true} is VALID [2022-02-20 19:57:16,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {37496#true} assume true; {37496#true} is VALID [2022-02-20 19:57:16,521 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {37496#true} {37501#(= ~p_dw_st~0 0)} #994#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {37501#(= ~p_dw_st~0 0)} assume !false; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {37501#(= ~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; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {37501#(= ~p_dw_st~0 0)} assume !false; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,522 INFO L272 TraceCheckUtils]: 47: Hoare triple {37501#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {37496#true} is VALID [2022-02-20 19:57:16,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {37496#true} havoc ~__retres1~2; {37496#true} is VALID [2022-02-20 19:57:16,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {37496#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {37501#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {37501#(= ~p_dw_st~0 0)} assume true; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,523 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37501#(= ~p_dw_st~0 0)} {37501#(= ~p_dw_st~0 0)} #996#return; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {37501#(= ~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; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {37501#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {37501#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {37501#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {37497#false} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {37497#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; {37497#false} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {37497#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; {37497#false} is VALID [2022-02-20 19:57:16,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {37497#false} assume 0 == ~c_dr_pc~0; {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {37497#false} assume !false; {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {37497#false} assume !(1 == ~q_free~0); {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {37497#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; {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {37497#false} assume !(~p_last_write~0 == ~c_last_read~0); {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L272 TraceCheckUtils]: 63: Hoare triple {37497#false} call error1(); {37497#false} is VALID [2022-02-20 19:57:16,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {37497#false} assume !false; {37497#false} is VALID [2022-02-20 19:57:16,525 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:16,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:16,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831176246] [2022-02-20 19:57:16,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831176246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:16,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:16,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:16,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473647061] [2022-02-20 19:57:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:16,528 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:57:16,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:16,528 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:57:16,557 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:16,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:16,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:16,559 INFO L87 Difference]: Start difference. First operand 1341 states and 1751 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:57:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,385 INFO L93 Difference]: Finished difference Result 3720 states and 4793 transitions. [2022-02-20 19:57:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:18,385 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:57:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:18,386 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:57:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 674 transitions. [2022-02-20 19:57:18,390 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:57:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 674 transitions. [2022-02-20 19:57:18,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 674 transitions. [2022-02-20 19:57:18,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 674 edges. 674 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:19,113 INFO L225 Difference]: With dead ends: 3720 [2022-02-20 19:57:19,114 INFO L226 Difference]: Without dead ends: 2566 [2022-02-20 19:57:19,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:19,119 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 957 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:19,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 937 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-02-20 19:57:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2426. [2022-02-20 19:57:19,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:19,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2566 states. Second operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) [2022-02-20 19:57:19,253 INFO L74 IsIncluded]: Start isIncluded. First operand 2566 states. Second operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) [2022-02-20 19:57:19,256 INFO L87 Difference]: Start difference. First operand 2566 states. Second operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) [2022-02-20 19:57:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,418 INFO L93 Difference]: Finished difference Result 2566 states and 3265 transitions. [2022-02-20 19:57:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3265 transitions. [2022-02-20 19:57:19,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:19,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:19,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) Second operand 2566 states. [2022-02-20 19:57:19,429 INFO L87 Difference]: Start difference. First operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) Second operand 2566 states. [2022-02-20 19:57:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,592 INFO L93 Difference]: Finished difference Result 2566 states and 3265 transitions. [2022-02-20 19:57:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3265 transitions. [2022-02-20 19:57:19,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:19,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:19,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:19,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1925 states have (on average 1.3012987012987014) internal successors, (2505), 1958 states have internal predecessors, (2505), 249 states have call successors, (249), 201 states have call predecessors, (249), 250 states have return successors, (356), 269 states have call predecessors, (356), 247 states have call successors, (356) [2022-02-20 19:57:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3110 transitions. [2022-02-20 19:57:19,814 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3110 transitions. Word has length 65 [2022-02-20 19:57:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:19,815 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3110 transitions. [2022-02-20 19:57:19,815 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:57:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3110 transitions. [2022-02-20 19:57:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:19,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:19,816 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:57:19,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:19,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash 264887933, now seen corresponding path program 1 times [2022-02-20 19:57:19,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:19,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177488556] [2022-02-20 19:57:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {51026#(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); {50986#true} is VALID [2022-02-20 19:57:19,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #988#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {51027#(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); {50986#true} is VALID [2022-02-20 19:57:19,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume !(0 == ~q_write_ev~0); {50986#true} is VALID [2022-02-20 19:57:19,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #990#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {50986#true} havoc ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume !(1 == ~p_dw_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} ~__retres1~0 := 0; {50986#true} is VALID [2022-02-20 19:57:19,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {50986#true} #res := ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,869 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50986#true} {50986#true} #984#return; {50986#true} is VALID [2022-02-20 19:57:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {50986#true} havoc ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume !(1 == ~c_dr_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} ~__retres1~1 := 0; {50986#true} is VALID [2022-02-20 19:57:19,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {50986#true} #res := ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,878 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50986#true} {50986#true} #986#return; {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {51028#(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; {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L272 TraceCheckUtils]: 1: Hoare triple {50986#true} call #t~ret8 := is_do_write_p_triggered(); {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} havoc ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {50986#true} assume !(1 == ~p_dw_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {50986#true} ~__retres1~0 := 0; {50986#true} is VALID [2022-02-20 19:57:19,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {50986#true} #res := ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {50986#true} {50986#true} #984#return; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {50986#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {50986#true} assume !(0 != ~tmp~1); {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {50986#true} call #t~ret9 := is_do_read_c_triggered(); {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {50986#true} havoc ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {50986#true} assume !(1 == ~c_dr_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {50986#true} ~__retres1~1 := 0; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {50986#true} #res := ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50986#true} {50986#true} #986#return; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {50986#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {50986#true} assume !(0 != ~tmp___0~1); {50986#true} is VALID [2022-02-20 19:57:19,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,897 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #992#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {51027#(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); {50986#true} is VALID [2022-02-20 19:57:19,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume !(1 == ~q_write_ev~0); {50986#true} is VALID [2022-02-20 19:57:19,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #994#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:19,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {50986#true} havoc ~__retres1~2; {50986#true} is VALID [2022-02-20 19:57:19,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50986#true} is VALID [2022-02-20 19:57:19,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} #res := ~__retres1~2; {50986#true} is VALID [2022-02-20 19:57:19,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,906 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #996#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {50986#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {50986#true} is VALID [2022-02-20 19:57:19,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {50986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {50986#true} is VALID [2022-02-20 19:57:19,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {50986#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {50988#(= ~q_free~0 1)} call update_channels1(); {51026#(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:19,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {51026#(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); {50986#true} is VALID [2022-02-20 19:57:19,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,908 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #988#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {50988#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {50988#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {50988#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {50988#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,909 INFO L272 TraceCheckUtils]: 12: Hoare triple {50988#(= ~q_free~0 1)} call fire_delta_events1(); {51027#(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:19,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {51027#(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); {50986#true} is VALID [2022-02-20 19:57:19,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {50986#true} assume !(0 == ~q_write_ev~0); {50986#true} is VALID [2022-02-20 19:57:19,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,910 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #990#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {50988#(= ~q_free~0 1)} call activate_threads1(); {51028#(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:19,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {51028#(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; {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {50986#true} call #t~ret8 := is_do_write_p_triggered(); {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {50986#true} havoc ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {50986#true} assume !(1 == ~p_dw_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {50986#true} ~__retres1~0 := 0; {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {50986#true} #res := ~__retres1~0; {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,911 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {50986#true} {50986#true} #984#return; {50986#true} is VALID [2022-02-20 19:57:19,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {50986#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50986#true} is VALID [2022-02-20 19:57:19,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {50986#true} assume !(0 != ~tmp~1); {50986#true} is VALID [2022-02-20 19:57:19,912 INFO L272 TraceCheckUtils]: 28: Hoare triple {50986#true} call #t~ret9 := is_do_read_c_triggered(); {50986#true} is VALID [2022-02-20 19:57:19,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {50986#true} havoc ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {50986#true} assume !(1 == ~c_dr_pc~0); {50986#true} is VALID [2022-02-20 19:57:19,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {50986#true} ~__retres1~1 := 0; {50986#true} is VALID [2022-02-20 19:57:19,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {50986#true} #res := ~__retres1~1; {50986#true} is VALID [2022-02-20 19:57:19,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,915 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50986#true} {50986#true} #986#return; {50986#true} is VALID [2022-02-20 19:57:19,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {50986#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50986#true} is VALID [2022-02-20 19:57:19,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {50986#true} assume !(0 != ~tmp___0~1); {50986#true} is VALID [2022-02-20 19:57:19,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,916 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #992#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,916 INFO L272 TraceCheckUtils]: 39: Hoare triple {50988#(= ~q_free~0 1)} call reset_delta_events1(); {51027#(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:19,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {51027#(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); {50986#true} is VALID [2022-02-20 19:57:19,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {50986#true} assume !(1 == ~q_write_ev~0); {50986#true} is VALID [2022-02-20 19:57:19,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,917 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #994#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {50988#(= ~q_free~0 1)} assume !false; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {50988#(= ~q_free~0 1)} assume !false; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {50988#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {50986#true} is VALID [2022-02-20 19:57:19,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {50986#true} havoc ~__retres1~2; {50986#true} is VALID [2022-02-20 19:57:19,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {50986#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {50986#true} is VALID [2022-02-20 19:57:19,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {50986#true} #res := ~__retres1~2; {50986#true} is VALID [2022-02-20 19:57:19,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {50986#true} assume true; {50986#true} is VALID [2022-02-20 19:57:19,919 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50986#true} {50988#(= ~q_free~0 1)} #996#return; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {50988#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {50988#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {50988#(= ~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; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {50988#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {50988#(= ~q_free~0 1)} assume !false; {50988#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:19,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {50988#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {50987#false} is VALID [2022-02-20 19:57:19,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {50987#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; {50987#false} is VALID [2022-02-20 19:57:19,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {50987#false} assume !(~p_last_write~0 == ~c_last_read~0); {50987#false} is VALID [2022-02-20 19:57:19,924 INFO L272 TraceCheckUtils]: 64: Hoare triple {50987#false} call error1(); {50987#false} is VALID [2022-02-20 19:57:19,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {50987#false} assume !false; {50987#false} is VALID [2022-02-20 19:57:19,924 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:19,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:19,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177488556] [2022-02-20 19:57:19,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177488556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:19,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:19,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:19,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103941229] [2022-02-20 19:57:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:19,926 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:57:19,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:19,927 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:57:19,971 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:57:19,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:19,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:19,973 INFO L87 Difference]: Start difference. First operand 2426 states and 3110 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:57:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,368 INFO L93 Difference]: Finished difference Result 5570 states and 7140 transitions. [2022-02-20 19:57:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:22,368 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:57:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:22,369 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:57:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 660 transitions. [2022-02-20 19:57:22,372 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:57:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 660 transitions. [2022-02-20 19:57:22,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 660 transitions. [2022-02-20 19:57:22,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:23,315 INFO L225 Difference]: With dead ends: 5570 [2022-02-20 19:57:23,315 INFO L226 Difference]: Without dead ends: 3479 [2022-02-20 19:57:23,318 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:57:23,318 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 500 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:23,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 1093 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2022-02-20 19:57:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3223. [2022-02-20 19:57:23,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:23,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3479 states. Second operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) [2022-02-20 19:57:23,498 INFO L74 IsIncluded]: Start isIncluded. First operand 3479 states. Second operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) [2022-02-20 19:57:23,501 INFO L87 Difference]: Start difference. First operand 3479 states. Second operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) [2022-02-20 19:57:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,821 INFO L93 Difference]: Finished difference Result 3479 states and 4386 transitions. [2022-02-20 19:57:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4386 transitions. [2022-02-20 19:57:23,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) Second operand 3479 states. [2022-02-20 19:57:23,834 INFO L87 Difference]: Start difference. First operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) Second operand 3479 states. [2022-02-20 19:57:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:24,163 INFO L93 Difference]: Finished difference Result 3479 states and 4386 transitions. [2022-02-20 19:57:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4386 transitions. [2022-02-20 19:57:24,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:24,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:24,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:24,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2548 states have (on average 1.2880690737833596) internal successors, (3282), 2577 states have internal predecessors, (3282), 339 states have call successors, (339), 279 states have call predecessors, (339), 334 states have return successors, (473), 369 states have call predecessors, (473), 337 states have call successors, (473) [2022-02-20 19:57:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4094 transitions. [2022-02-20 19:57:24,624 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4094 transitions. Word has length 66 [2022-02-20 19:57:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:24,624 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 4094 transitions. [2022-02-20 19:57:24,624 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:57:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4094 transitions. [2022-02-20 19:57:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:24,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:24,625 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:57:24,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:24,625 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1723127592, now seen corresponding path program 1 times [2022-02-20 19:57:24,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:24,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126375079] [2022-02-20 19:57:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {69889#(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); {69849#true} is VALID [2022-02-20 19:57:24,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #988#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {69890#(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); {69849#true} is VALID [2022-02-20 19:57:24,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume !(0 == ~q_write_ev~0); {69849#true} is VALID [2022-02-20 19:57:24,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #990#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {69849#true} havoc ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume !(1 == ~p_dw_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} ~__retres1~0 := 0; {69849#true} is VALID [2022-02-20 19:57:24,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {69849#true} #res := ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,677 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {69849#true} {69849#true} #984#return; {69849#true} is VALID [2022-02-20 19:57:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {69849#true} havoc ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume !(1 == ~c_dr_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} ~__retres1~1 := 0; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {69849#true} #res := ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {69849#true} {69849#true} #986#return; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {69891#(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; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L272 TraceCheckUtils]: 1: Hoare triple {69849#true} call #t~ret8 := is_do_write_p_triggered(); {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} havoc ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {69849#true} assume !(1 == ~p_dw_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {69849#true} ~__retres1~0 := 0; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {69849#true} #res := ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {69849#true} {69849#true} #984#return; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {69849#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {69849#true} assume !(0 != ~tmp~1); {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L272 TraceCheckUtils]: 10: Hoare triple {69849#true} call #t~ret9 := is_do_read_c_triggered(); {69849#true} is VALID [2022-02-20 19:57:24,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {69849#true} havoc ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {69849#true} assume !(1 == ~c_dr_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {69849#true} ~__retres1~1 := 0; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {69849#true} #res := ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {69849#true} {69849#true} #986#return; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {69849#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {69849#true} assume !(0 != ~tmp___0~1); {69849#true} is VALID [2022-02-20 19:57:24,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,682 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #992#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {69890#(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); {69849#true} is VALID [2022-02-20 19:57:24,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume !(1 == ~q_write_ev~0); {69849#true} is VALID [2022-02-20 19:57:24,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #994#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {69849#true} havoc ~__retres1~2; {69849#true} is VALID [2022-02-20 19:57:24,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69849#true} is VALID [2022-02-20 19:57:24,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} #res := ~__retres1~2; {69849#true} is VALID [2022-02-20 19:57:24,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,704 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #996#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {69849#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {69849#true} is VALID [2022-02-20 19:57:24,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {69849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {69849#true} is VALID [2022-02-20 19:57:24,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {69849#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {69851#(= ~c_dr_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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {69851#(= ~c_dr_pc~0 0)} call update_channels1(); {69889#(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:24,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {69889#(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); {69849#true} is VALID [2022-02-20 19:57:24,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,706 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #988#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,707 INFO L272 TraceCheckUtils]: 12: Hoare triple {69851#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {69890#(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:24,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {69890#(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); {69849#true} is VALID [2022-02-20 19:57:24,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {69849#true} assume !(0 == ~q_write_ev~0); {69849#true} is VALID [2022-02-20 19:57:24,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,708 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #990#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,708 INFO L272 TraceCheckUtils]: 17: Hoare triple {69851#(= ~c_dr_pc~0 0)} call activate_threads1(); {69891#(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:24,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {69891#(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; {69849#true} is VALID [2022-02-20 19:57:24,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {69849#true} call #t~ret8 := is_do_write_p_triggered(); {69849#true} is VALID [2022-02-20 19:57:24,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {69849#true} havoc ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {69849#true} assume !(1 == ~p_dw_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {69849#true} ~__retres1~0 := 0; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {69849#true} #res := ~__retres1~0; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {69849#true} {69849#true} #984#return; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {69849#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {69849#true} assume !(0 != ~tmp~1); {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L272 TraceCheckUtils]: 28: Hoare triple {69849#true} call #t~ret9 := is_do_read_c_triggered(); {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {69849#true} havoc ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {69849#true} assume !(1 == ~c_dr_pc~0); {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {69849#true} ~__retres1~1 := 0; {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {69849#true} #res := ~__retres1~1; {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {69849#true} {69849#true} #986#return; {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {69849#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {69849#true} assume !(0 != ~tmp___0~1); {69849#true} is VALID [2022-02-20 19:57:24,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,711 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #992#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,711 INFO L272 TraceCheckUtils]: 39: Hoare triple {69851#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {69890#(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:24,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {69890#(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); {69849#true} is VALID [2022-02-20 19:57:24,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {69849#true} assume !(1 == ~q_write_ev~0); {69849#true} is VALID [2022-02-20 19:57:24,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,712 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #994#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume !false; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {69851#(= ~c_dr_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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume !false; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,713 INFO L272 TraceCheckUtils]: 47: Hoare triple {69851#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {69849#true} is VALID [2022-02-20 19:57:24,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {69849#true} havoc ~__retres1~2; {69849#true} is VALID [2022-02-20 19:57:24,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {69849#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69849#true} is VALID [2022-02-20 19:57:24,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {69849#true} #res := ~__retres1~2; {69849#true} is VALID [2022-02-20 19:57:24,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {69849#true} assume true; {69849#true} is VALID [2022-02-20 19:57:24,714 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {69849#true} {69851#(= ~c_dr_pc~0 0)} #996#return; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {69851#(= ~c_dr_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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {69851#(= ~c_dr_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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {69851#(= ~c_dr_pc~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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {69851#(= ~c_dr_pc~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; {69851#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 59: Hoare triple {69851#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {69850#false} assume 1 == ~c_dr_pc~0; {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {69850#false} do_read_c_~a~0#1 := ~a_t~0; {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {69850#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; {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {69850#false} assume !(~p_last_write~0 == ~c_last_read~0); {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L272 TraceCheckUtils]: 64: Hoare triple {69850#false} call error1(); {69850#false} is VALID [2022-02-20 19:57:24,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {69850#false} assume !false; {69850#false} is VALID [2022-02-20 19:57:24,716 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:24,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:24,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126375079] [2022-02-20 19:57:24,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126375079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:24,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:24,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:24,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391135528] [2022-02-20 19:57:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:24,718 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:57:24,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:24,718 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:57:24,755 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:57:24,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:24,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:24,756 INFO L87 Difference]: Start difference. First operand 3223 states and 4094 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:57:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,233 INFO L93 Difference]: Finished difference Result 7713 states and 9720 transitions. [2022-02-20 19:57:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:28,233 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:57:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:28,233 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:57:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 672 transitions. [2022-02-20 19:57:28,237 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:57:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 672 transitions. [2022-02-20 19:57:28,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 672 transitions. [2022-02-20 19:57:28,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 672 edges. 672 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:29,534 INFO L225 Difference]: With dead ends: 7713 [2022-02-20 19:57:29,534 INFO L226 Difference]: Without dead ends: 4680 [2022-02-20 19:57:29,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:57:29,539 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 757 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:29,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 955 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2022-02-20 19:57:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4312. [2022-02-20 19:57:29,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:29,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4680 states. Second operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) [2022-02-20 19:57:29,772 INFO L74 IsIncluded]: Start isIncluded. First operand 4680 states. Second operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) [2022-02-20 19:57:29,776 INFO L87 Difference]: Start difference. First operand 4680 states. Second operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) [2022-02-20 19:57:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,328 INFO L93 Difference]: Finished difference Result 4680 states and 5831 transitions. [2022-02-20 19:57:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5831 transitions. [2022-02-20 19:57:30,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) Second operand 4680 states. [2022-02-20 19:57:30,343 INFO L87 Difference]: Start difference. First operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) Second operand 4680 states. [2022-02-20 19:57:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,897 INFO L93 Difference]: Finished difference Result 4680 states and 5831 transitions. [2022-02-20 19:57:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5831 transitions. [2022-02-20 19:57:30,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:30,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3387 states have (on average 1.2669028638913493) internal successors, (4291), 3432 states have internal predecessors, (4291), 465 states have call successors, (465), 389 states have call predecessors, (465), 458 states have return successors, (642), 493 states have call predecessors, (642), 463 states have call successors, (642) [2022-02-20 19:57:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5398 transitions. [2022-02-20 19:57:31,650 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5398 transitions. Word has length 66 [2022-02-20 19:57:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:31,650 INFO L470 AbstractCegarLoop]: Abstraction has 4312 states and 5398 transitions. [2022-02-20 19:57:31,650 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:57:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5398 transitions. [2022-02-20 19:57:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:31,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:31,651 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:57:31,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:31,651 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -792696971, now seen corresponding path program 1 times [2022-02-20 19:57:31,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:31,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069476474] [2022-02-20 19:57:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {95533#(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); {95492#true} is VALID [2022-02-20 19:57:31,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95492#true} {95492#true} #988#return; {95492#true} is VALID [2022-02-20 19:57:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {95534#(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); {95492#true} is VALID [2022-02-20 19:57:31,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume !(0 == ~q_write_ev~0); {95492#true} is VALID [2022-02-20 19:57:31,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95492#true} {95492#true} #990#return; {95492#true} is VALID [2022-02-20 19:57:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {95492#true} havoc ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume !(1 == ~p_dw_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} ~__retres1~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {95492#true} #res := ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,712 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {95492#true} {95492#true} #984#return; {95492#true} is VALID [2022-02-20 19:57:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {95492#true} havoc ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume !(1 == ~c_dr_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} ~__retres1~1 := 0; {95492#true} is VALID [2022-02-20 19:57:31,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {95492#true} #res := ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,714 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {95492#true} {95492#true} #986#return; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {95535#(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; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L272 TraceCheckUtils]: 1: Hoare triple {95492#true} call #t~ret8 := is_do_write_p_triggered(); {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} havoc ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {95492#true} assume !(1 == ~p_dw_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {95492#true} ~__retres1~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {95492#true} #res := ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,715 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {95492#true} {95492#true} #984#return; {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {95492#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {95492#true} assume !(0 != ~tmp~1); {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L272 TraceCheckUtils]: 10: Hoare triple {95492#true} call #t~ret9 := is_do_read_c_triggered(); {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {95492#true} havoc ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {95492#true} assume !(1 == ~c_dr_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {95492#true} ~__retres1~1 := 0; {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {95492#true} #res := ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {95492#true} {95492#true} #986#return; {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {95492#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {95492#true} assume !(0 != ~tmp___0~1); {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {95492#true} {95492#true} #992#return; {95492#true} is VALID [2022-02-20 19:57:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {95534#(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); {95492#true} is VALID [2022-02-20 19:57:31,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume !(1 == ~q_write_ev~0); {95492#true} is VALID [2022-02-20 19:57:31,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95492#true} {95492#true} #994#return; {95492#true} is VALID [2022-02-20 19:57:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {95492#true} havoc ~__retres1~2; {95492#true} is VALID [2022-02-20 19:57:31,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95492#true} is VALID [2022-02-20 19:57:31,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} #res := ~__retres1~2; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {95492#true} {95492#true} #996#return; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {95492#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {95492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {95492#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {95492#true} is VALID [2022-02-20 19:57:31,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {95492#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; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {95492#true} call update_channels1(); {95533#(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:31,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {95533#(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); {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {95492#true} {95492#true} #988#return; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {95492#true} assume { :begin_inline_init_threads1 } true; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {95492#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {95492#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {95492#true} assume { :end_inline_init_threads1 } true; {95492#true} is VALID [2022-02-20 19:57:31,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {95492#true} call fire_delta_events1(); {95534#(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:31,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {95534#(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); {95492#true} is VALID [2022-02-20 19:57:31,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {95492#true} assume !(0 == ~q_write_ev~0); {95492#true} is VALID [2022-02-20 19:57:31,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,725 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {95492#true} {95492#true} #990#return; {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L272 TraceCheckUtils]: 17: Hoare triple {95492#true} call activate_threads1(); {95535#(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:31,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {95535#(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; {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L272 TraceCheckUtils]: 19: Hoare triple {95492#true} call #t~ret8 := is_do_write_p_triggered(); {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {95492#true} havoc ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {95492#true} assume !(1 == ~p_dw_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {95492#true} ~__retres1~0 := 0; {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {95492#true} #res := ~__retres1~0; {95492#true} is VALID [2022-02-20 19:57:31,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {95492#true} {95492#true} #984#return; {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {95492#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {95492#true} assume !(0 != ~tmp~1); {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L272 TraceCheckUtils]: 28: Hoare triple {95492#true} call #t~ret9 := is_do_read_c_triggered(); {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {95492#true} havoc ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {95492#true} assume !(1 == ~c_dr_pc~0); {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {95492#true} ~__retres1~1 := 0; {95492#true} is VALID [2022-02-20 19:57:31,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {95492#true} #res := ~__retres1~1; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {95492#true} {95492#true} #986#return; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {95492#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {95492#true} assume !(0 != ~tmp___0~1); {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {95492#true} {95492#true} #992#return; {95492#true} is VALID [2022-02-20 19:57:31,728 INFO L272 TraceCheckUtils]: 39: Hoare triple {95492#true} call reset_delta_events1(); {95534#(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:31,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {95534#(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); {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {95492#true} assume !(1 == ~q_write_ev~0); {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {95492#true} {95492#true} #994#return; {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {95492#true} assume !false; {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {95492#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; {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {95492#true} assume !false; {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L272 TraceCheckUtils]: 47: Hoare triple {95492#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {95492#true} is VALID [2022-02-20 19:57:31,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {95492#true} havoc ~__retres1~2; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {95492#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {95492#true} #res := ~__retres1~2; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {95492#true} assume true; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {95492#true} {95492#true} #996#return; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {95492#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; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {95492#true} assume 0 != eval1_~tmp___1~0#1; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {95492#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; {95492#true} is VALID [2022-02-20 19:57:31,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {95492#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; {95492#true} is VALID [2022-02-20 19:57:31,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {95492#true} assume 0 == ~p_dw_pc~0; {95492#true} is VALID [2022-02-20 19:57:31,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {95492#true} assume !false; {95492#true} is VALID [2022-02-20 19:57:31,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {95492#true} assume !(0 == ~q_free~0); {95492#true} is VALID [2022-02-20 19:57:31,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {95492#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; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {95531#(= ~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; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {95531#(= ~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; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {95531#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {95531#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:31,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {95531#(= ~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; {95532#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:31,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {95532#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {95493#false} is VALID [2022-02-20 19:57:31,734 INFO L272 TraceCheckUtils]: 71: Hoare triple {95493#false} call error1(); {95493#false} is VALID [2022-02-20 19:57:31,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {95493#false} assume !false; {95493#false} is VALID [2022-02-20 19:57:31,735 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:57:31,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:31,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069476474] [2022-02-20 19:57:31,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069476474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:31,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:31,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:31,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814613317] [2022-02-20 19:57:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:31,736 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:57:31,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:31,736 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:57:31,773 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:57:31,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:31,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:31,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:31,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:31,774 INFO L87 Difference]: Start difference. First operand 4312 states and 5398 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:57:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:34,252 INFO L93 Difference]: Finished difference Result 5057 states and 6301 transitions. [2022-02-20 19:57:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:34,253 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:57:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:34,253 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:57:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 540 transitions. [2022-02-20 19:57:34,256 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:57:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 540 transitions. [2022-02-20 19:57:34,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 540 transitions. [2022-02-20 19:57:34,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:35,593 INFO L225 Difference]: With dead ends: 5057 [2022-02-20 19:57:35,593 INFO L226 Difference]: Without dead ends: 5054 [2022-02-20 19:57:35,594 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:57:35,594 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 1307 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:35,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1317 Valid, 789 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2022-02-20 19:57:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 4437. [2022-02-20 19:57:35,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:35,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5054 states. Second operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) [2022-02-20 19:57:35,867 INFO L74 IsIncluded]: Start isIncluded. First operand 5054 states. Second operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) [2022-02-20 19:57:35,871 INFO L87 Difference]: Start difference. First operand 5054 states. Second operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) [2022-02-20 19:57:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,507 INFO L93 Difference]: Finished difference Result 5054 states and 6287 transitions. [2022-02-20 19:57:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6287 transitions. [2022-02-20 19:57:36,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:36,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:36,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) Second operand 5054 states. [2022-02-20 19:57:36,521 INFO L87 Difference]: Start difference. First operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) Second operand 5054 states. [2022-02-20 19:57:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:37,170 INFO L93 Difference]: Finished difference Result 5054 states and 6287 transitions. [2022-02-20 19:57:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6287 transitions. [2022-02-20 19:57:37,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:37,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:37,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:37,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 3497 states have (on average 1.2670860737775236) internal successors, (4431), 3543 states have internal predecessors, (4431), 472 states have call successors, (472), 397 states have call predecessors, (472), 466 states have return successors, (653), 499 states have call predecessors, (653), 471 states have call successors, (653) [2022-02-20 19:57:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5556 transitions. [2022-02-20 19:57:37,945 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5556 transitions. Word has length 73 [2022-02-20 19:57:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:37,946 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 5556 transitions. [2022-02-20 19:57:37,946 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:57:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5556 transitions. [2022-02-20 19:57:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:37,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:37,947 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:57:37,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:37,948 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1195350886, now seen corresponding path program 1 times [2022-02-20 19:57:37,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:37,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267598733] [2022-02-20 19:57:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {118491#(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); {118449#true} is VALID [2022-02-20 19:57:38,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #988#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {118492#(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); {118449#true} is VALID [2022-02-20 19:57:38,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume !(0 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #990#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#true} havoc ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume !(1 == ~p_dw_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} ~__retres1~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {118449#true} #res := ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,040 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {118449#true} {118449#true} #984#return; {118449#true} is VALID [2022-02-20 19:57:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#true} havoc ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume !(1 == ~c_dr_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} ~__retres1~1 := 0; {118449#true} is VALID [2022-02-20 19:57:38,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {118449#true} #res := ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,043 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {118449#true} {118449#true} #986#return; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {118493#(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; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L272 TraceCheckUtils]: 1: Hoare triple {118449#true} call #t~ret8 := is_do_write_p_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} havoc ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {118449#true} assume !(1 == ~p_dw_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {118449#true} ~__retres1~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {118449#true} #res := ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,044 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118449#true} {118449#true} #984#return; {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {118449#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {118449#true} assume !(0 != ~tmp~1); {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L272 TraceCheckUtils]: 10: Hoare triple {118449#true} call #t~ret9 := is_do_read_c_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {118449#true} havoc ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {118449#true} assume !(1 == ~c_dr_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {118449#true} ~__retres1~1 := 0; {118449#true} is VALID [2022-02-20 19:57:38,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {118449#true} #res := ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118449#true} {118449#true} #986#return; {118449#true} is VALID [2022-02-20 19:57:38,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {118449#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118449#true} is VALID [2022-02-20 19:57:38,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {118449#true} assume !(0 != ~tmp___0~1); {118449#true} is VALID [2022-02-20 19:57:38,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,047 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #992#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {118492#(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); {118449#true} is VALID [2022-02-20 19:57:38,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume !(1 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #994#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#true} havoc ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118449#true} is VALID [2022-02-20 19:57:38,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} #res := ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,055 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #996#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {118449#true} is VALID [2022-02-20 19:57:38,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {118491#(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:38,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {118491#(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); {118449#true} is VALID [2022-02-20 19:57:38,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,057 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #988#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,059 INFO L272 TraceCheckUtils]: 12: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {118492#(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:38,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {118492#(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); {118449#true} is VALID [2022-02-20 19:57:38,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {118449#true} assume !(0 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,060 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #990#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {118493#(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:38,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {118493#(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; {118449#true} is VALID [2022-02-20 19:57:38,060 INFO L272 TraceCheckUtils]: 19: Hoare triple {118449#true} call #t~ret8 := is_do_write_p_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {118449#true} havoc ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {118449#true} assume !(1 == ~p_dw_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {118449#true} ~__retres1~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {118449#true} #res := ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118449#true} {118449#true} #984#return; {118449#true} is VALID [2022-02-20 19:57:38,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {118449#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {118449#true} assume !(0 != ~tmp~1); {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L272 TraceCheckUtils]: 28: Hoare triple {118449#true} call #t~ret9 := is_do_read_c_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {118449#true} havoc ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {118449#true} assume !(1 == ~c_dr_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {118449#true} ~__retres1~1 := 0; {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {118449#true} #res := ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,062 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118449#true} {118449#true} #986#return; {118449#true} is VALID [2022-02-20 19:57:38,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {118449#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118449#true} is VALID [2022-02-20 19:57:38,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {118449#true} assume !(0 != ~tmp___0~1); {118449#true} is VALID [2022-02-20 19:57:38,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,063 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #992#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,064 INFO L272 TraceCheckUtils]: 39: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {118492#(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:38,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {118492#(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); {118449#true} is VALID [2022-02-20 19:57:38,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {118449#true} assume !(1 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,065 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #994#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,066 INFO L272 TraceCheckUtils]: 47: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {118449#true} is VALID [2022-02-20 19:57:38,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {118449#true} havoc ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {118449#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118449#true} is VALID [2022-02-20 19:57:38,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {118449#true} #res := ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,067 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118449#true} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #996#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {118451#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {118489#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {118490#(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); {118450#false} is VALID [2022-02-20 19:57:38,074 INFO L272 TraceCheckUtils]: 72: Hoare triple {118450#false} call error1(); {118450#false} is VALID [2022-02-20 19:57:38,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {118450#false} assume !false; {118450#false} is VALID [2022-02-20 19:57:38,075 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:57:38,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:38,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267598733] [2022-02-20 19:57:38,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267598733] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:38,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572205464] [2022-02-20 19:57:38,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:38,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:38,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:38,078 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:57:38,078 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:57:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:38,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {118449#true} is VALID [2022-02-20 19:57:38,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,654 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #988#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,656 INFO L272 TraceCheckUtils]: 12: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #990#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,658 INFO L272 TraceCheckUtils]: 17: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,659 INFO L272 TraceCheckUtils]: 19: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,661 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #984#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,662 INFO L272 TraceCheckUtils]: 28: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,664 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #986#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,665 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #992#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,665 INFO L272 TraceCheckUtils]: 39: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,666 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #994#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,668 INFO L272 TraceCheckUtils]: 47: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,669 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #996#return; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {118451#(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; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,672 INFO L290 TraceCheckUtils]: 59: Hoare triple {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {118451#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:38,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {118451#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,673 INFO L290 TraceCheckUtils]: 62: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,673 INFO L290 TraceCheckUtils]: 63: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,674 INFO L290 TraceCheckUtils]: 65: Hoare triple {118489#(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; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,674 INFO L290 TraceCheckUtils]: 66: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,674 INFO L290 TraceCheckUtils]: 67: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {118489#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {118489#(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; {118716#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,675 INFO L290 TraceCheckUtils]: 70: Hoare triple {118716#(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; {118716#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:38,676 INFO L290 TraceCheckUtils]: 71: Hoare triple {118716#(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); {118450#false} is VALID [2022-02-20 19:57:38,676 INFO L272 TraceCheckUtils]: 72: Hoare triple {118450#false} call error1(); {118450#false} is VALID [2022-02-20 19:57:38,676 INFO L290 TraceCheckUtils]: 73: Hoare triple {118450#false} assume !false; {118450#false} is VALID [2022-02-20 19:57:38,676 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:57:38,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:38,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {118450#false} assume !false; {118450#false} is VALID [2022-02-20 19:57:38,969 INFO L272 TraceCheckUtils]: 72: Hoare triple {118450#false} call error1(); {118450#false} is VALID [2022-02-20 19:57:38,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {118490#(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); {118450#false} is VALID [2022-02-20 19:57:38,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,970 INFO L290 TraceCheckUtils]: 69: Hoare triple {118741#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {118741#(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; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {118741#(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; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {118741#(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; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {118741#(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; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {118490#(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; {118741#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:38,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,976 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {118449#true} {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #996#return; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {118449#true} #res := ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {118449#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {118449#true} is VALID [2022-02-20 19:57:38,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {118449#true} havoc ~__retres1~2; {118449#true} is VALID [2022-02-20 19:57:38,977 INFO L272 TraceCheckUtils]: 47: Hoare triple {118490#(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(); {118449#true} is VALID [2022-02-20 19:57:38,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,978 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {118449#true} {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #994#return; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {118449#true} assume !(1 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {118449#true} assume !(1 == ~q_read_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,978 INFO L272 TraceCheckUtils]: 39: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {118449#true} {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #992#return; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {118449#true} assume !(0 != ~tmp___0~1); {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {118449#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {118449#true} {118449#true} #986#return; {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {118449#true} #res := ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {118449#true} ~__retres1~1 := 0; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {118449#true} assume !(1 == ~c_dr_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {118449#true} havoc ~__retres1~1; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L272 TraceCheckUtils]: 28: Hoare triple {118449#true} call #t~ret9 := is_do_read_c_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {118449#true} assume !(0 != ~tmp~1); {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {118449#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {118449#true} {118449#true} #984#return; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {118449#true} #res := ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {118449#true} ~__retres1~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {118449#true} assume !(1 == ~p_dw_pc~0); {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {118449#true} havoc ~__retres1~0; {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {118449#true} call #t~ret8 := is_do_write_p_triggered(); {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {118449#true} havoc ~tmp~1;havoc ~tmp___0~1; {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L272 TraceCheckUtils]: 17: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {118449#true} is VALID [2022-02-20 19:57:38,981 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {118449#true} {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #990#return; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {118449#true} assume !(0 == ~q_write_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {118449#true} assume !(0 == ~q_read_ev~0); {118449#true} is VALID [2022-02-20 19:57:38,982 INFO L272 TraceCheckUtils]: 12: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {118449#true} is VALID [2022-02-20 19:57:38,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,984 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {118449#true} {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #988#return; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {118449#true} assume true; {118449#true} is VALID [2022-02-20 19:57:38,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {118449#true} assume !(1 == ~q_req_up~0); {118449#true} is VALID [2022-02-20 19:57:38,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {118449#true} is VALID [2022-02-20 19:57:38,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {118490#(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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {118449#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {118490#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:38,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {118449#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {118449#true} is VALID [2022-02-20 19:57:38,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {118449#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {118449#true} is VALID [2022-02-20 19:57:38,985 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:57:38,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572205464] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:38,986 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:38,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:38,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37278539] [2022-02-20 19:57:38,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:38,986 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:57:38,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:38,988 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:57:39,082 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:57:39,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:39,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:39,083 INFO L87 Difference]: Start difference. First operand 4437 states and 5556 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) [2022-02-20 19:57:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,066 INFO L93 Difference]: Finished difference Result 9615 states and 11886 transitions. [2022-02-20 19:57:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 19:57:48,067 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:57:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:57:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1005 transitions. [2022-02-20 19:57:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:57:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1005 transitions. [2022-02-20 19:57:48,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 1005 transitions. [2022-02-20 19:57:48,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.