./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.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.12.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 a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:03,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:03,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:03,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:03,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:03,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:03,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:03,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:03,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:03,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:03,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:03,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:03,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:03,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:03,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:03,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:03,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:03,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:03,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:03,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:03,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:03,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:03,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:03,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:03,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:03,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:03,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:03,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:03,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:03,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:03,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:03,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:03,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:03,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:03,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:03,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:03,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:03,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:03,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:03,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:03,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:03,463 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:58:03,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:03,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:03,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:03,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:03,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:03,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:03,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:03,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:03,488 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:03,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:03,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:03,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:03,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:03,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:03,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:03,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:03,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:03,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:03,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:03,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:03,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:03,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:03,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:03,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:03,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:03,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:03,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:03,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:03,493 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 -> a41d14195dc7825ea8ff849a910a7045aa33d6087daf5af287d6c34e44b1032a [2022-02-20 19:58:03,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:03,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:03,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:03,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:03,658 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:03,659 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.12.cil-1.c [2022-02-20 19:58:03,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4907d66ba/abec2199365e48c797e06007d92d2308/FLAGacdc7777a [2022-02-20 19:58:04,068 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:04,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2022-02-20 19:58:04,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4907d66ba/abec2199365e48c797e06007d92d2308/FLAGacdc7777a [2022-02-20 19:58:04,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4907d66ba/abec2199365e48c797e06007d92d2308 [2022-02-20 19:58:04,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:04,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:04,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:04,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:04,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:04,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391c8095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04, skipping insertion in model container [2022-02-20 19:58:04,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:04,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:04,601 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.12.cil-1.c[914,927] [2022-02-20 19:58:04,637 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.12.cil-1.c[7115,7128] [2022-02-20 19:58:04,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:04,746 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:04,756 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.12.cil-1.c[914,927] [2022-02-20 19:58:04,775 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.12.cil-1.c[7115,7128] [2022-02-20 19:58:04,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:04,843 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:04,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04 WrapperNode [2022-02-20 19:58:04,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:04,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:04,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:04,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:04,868 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:58:04" (1/1) ... [2022-02-20 19:58:04,882 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:58:04" (1/1) ... [2022-02-20 19:58:04,939 INFO L137 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1045 [2022-02-20 19:58:04,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:04,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:04,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:04,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:04,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:04,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:04,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:04,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:04,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (1/1) ... [2022-02-20 19:58:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:04,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:05,012 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:58:05,015 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:58:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:58:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:58:05,160 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:05,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:05,936 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:05,954 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:05,954 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 19:58:05,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:05 BoogieIcfgContainer [2022-02-20 19:58:05,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:05,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:05,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:05,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:05,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:04" (1/3) ... [2022-02-20 19:58:05,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6c734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:05, skipping insertion in model container [2022-02-20 19:58:05,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:04" (2/3) ... [2022-02-20 19:58:05,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6c734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:05, skipping insertion in model container [2022-02-20 19:58:05,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:05" (3/3) ... [2022-02-20 19:58:05,964 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-1.c [2022-02-20 19:58:05,968 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:05,968 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:06,006 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:06,015 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:58:06,015 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 491 states, 431 states have (on average 1.6450116009280742) internal successors, (709), 439 states have internal predecessors, (709), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:58:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:06,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:06,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:06,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1117056757, now seen corresponding path program 1 times [2022-02-20 19:58:06,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:06,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526690003] [2022-02-20 19:58:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(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); {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {496#(= ~q_read_ev~0 2)} #1913#return; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#(= |old(~q_read_ev~0)| 0)} assume true; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#(= |old(~q_read_ev~0)| 0)} {496#(= ~q_read_ev~0 2)} #1915#return; {495#false} is VALID [2022-02-20 19:58:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} havoc ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume 1 == ~p_dw_pc~0; {494#true} is VALID [2022-02-20 19:58:06,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {494#true} is VALID [2022-02-20 19:58:06,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} #res := ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,397 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {494#true} {494#true} #1909#return; {494#true} is VALID [2022-02-20 19:58:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} havoc ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume 1 == ~c_dr_pc~0; {494#true} is VALID [2022-02-20 19:58:06,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {494#true} is VALID [2022-02-20 19:58:06,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} #res := ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,405 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {494#true} {494#true} #1911#return; {494#true} is VALID [2022-02-20 19:58:06,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#(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; {494#true} is VALID [2022-02-20 19:58:06,406 INFO L272 TraceCheckUtils]: 1: Hoare triple {494#true} call #t~ret8 := is_do_write_p_triggered(); {494#true} is VALID [2022-02-20 19:58:06,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} havoc ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} assume 1 == ~p_dw_pc~0; {494#true} is VALID [2022-02-20 19:58:06,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {494#true} #res := ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {494#true} {494#true} #1909#return; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {494#true} is VALID [2022-02-20 19:58:06,407 INFO L272 TraceCheckUtils]: 10: Hoare triple {494#true} call #t~ret9 := is_do_read_c_triggered(); {494#true} is VALID [2022-02-20 19:58:06,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {494#true} havoc ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {494#true} assume 1 == ~c_dr_pc~0; {494#true} is VALID [2022-02-20 19:58:06,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {494#true} is VALID [2022-02-20 19:58:06,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#true} #res := ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,409 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {494#true} {494#true} #1911#return; {494#true} is VALID [2022-02-20 19:58:06,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {494#true} is VALID [2022-02-20 19:58:06,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {494#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {494#true} is VALID [2022-02-20 19:58:06,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,409 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {494#true} {495#false} #1917#return; {495#false} is VALID [2022-02-20 19:58:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#(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; {494#true} is VALID [2022-02-20 19:58:06,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {494#true} is VALID [2022-02-20 19:58:06,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {494#true} {495#false} #1919#return; {495#false} is VALID [2022-02-20 19:58:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} havoc ~__retres1~2; {494#true} is VALID [2022-02-20 19:58:06,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {494#true} is VALID [2022-02-20 19:58:06,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} #res := ~__retres1~2; {494#true} is VALID [2022-02-20 19:58:06,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,426 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {494#true} {495#false} #1921#return; {495#false} is VALID [2022-02-20 19:58:06,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {494#true} is VALID [2022-02-20 19:58:06,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {494#true} is VALID [2022-02-20 19:58:06,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {496#(= ~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; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {496#(= ~q_read_ev~0 2)} call update_channels1(); {534#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:06,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#(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); {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,431 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {535#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {496#(= ~q_read_ev~0 2)} #1913#return; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {496#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {496#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {496#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:06,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {496#(= ~q_read_ev~0 2)} call fire_delta_events1(); {536#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:06,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#(= |old(~q_read_ev~0)| 0)} assume true; {537#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:06,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {537#(= |old(~q_read_ev~0)| 0)} {496#(= ~q_read_ev~0 2)} #1915#return; {495#false} is VALID [2022-02-20 19:58:06,437 INFO L272 TraceCheckUtils]: 17: Hoare triple {495#false} call activate_threads1(); {538#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:06,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#(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; {494#true} is VALID [2022-02-20 19:58:06,438 INFO L272 TraceCheckUtils]: 19: Hoare triple {494#true} call #t~ret8 := is_do_write_p_triggered(); {494#true} is VALID [2022-02-20 19:58:06,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#true} havoc ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {494#true} assume 1 == ~p_dw_pc~0; {494#true} is VALID [2022-02-20 19:58:06,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {494#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {494#true} is VALID [2022-02-20 19:58:06,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {494#true} #res := ~__retres1~0; {494#true} is VALID [2022-02-20 19:58:06,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,442 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {494#true} {494#true} #1909#return; {494#true} is VALID [2022-02-20 19:58:06,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {494#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {494#true} is VALID [2022-02-20 19:58:06,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {494#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {494#true} is VALID [2022-02-20 19:58:06,442 INFO L272 TraceCheckUtils]: 28: Hoare triple {494#true} call #t~ret9 := is_do_read_c_triggered(); {494#true} is VALID [2022-02-20 19:58:06,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {494#true} havoc ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {494#true} assume 1 == ~c_dr_pc~0; {494#true} is VALID [2022-02-20 19:58:06,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {494#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {494#true} is VALID [2022-02-20 19:58:06,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {494#true} #res := ~__retres1~1; {494#true} is VALID [2022-02-20 19:58:06,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,445 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {494#true} {494#true} #1911#return; {494#true} is VALID [2022-02-20 19:58:06,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {494#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {494#true} is VALID [2022-02-20 19:58:06,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {494#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {494#true} is VALID [2022-02-20 19:58:06,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,445 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {494#true} {495#false} #1917#return; {495#false} is VALID [2022-02-20 19:58:06,446 INFO L272 TraceCheckUtils]: 39: Hoare triple {495#false} call reset_delta_events1(); {536#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:06,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {536#(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; {494#true} is VALID [2022-02-20 19:58:06,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {494#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {494#true} is VALID [2022-02-20 19:58:06,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,446 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {494#true} {495#false} #1919#return; {495#false} is VALID [2022-02-20 19:58:06,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {495#false} assume !false; {495#false} is VALID [2022-02-20 19:58:06,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {495#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; {495#false} is VALID [2022-02-20 19:58:06,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {495#false} assume !false; {495#false} is VALID [2022-02-20 19:58:06,447 INFO L272 TraceCheckUtils]: 47: Hoare triple {495#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {494#true} is VALID [2022-02-20 19:58:06,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {494#true} havoc ~__retres1~2; {494#true} is VALID [2022-02-20 19:58:06,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {494#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {494#true} is VALID [2022-02-20 19:58:06,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {494#true} #res := ~__retres1~2; {494#true} is VALID [2022-02-20 19:58:06,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {494#true} assume true; {494#true} is VALID [2022-02-20 19:58:06,457 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {494#true} {495#false} #1921#return; {495#false} is VALID [2022-02-20 19:58:06,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {495#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; {495#false} is VALID [2022-02-20 19:58:06,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {495#false} assume 0 != eval1_~tmp___1~0#1; {495#false} is VALID [2022-02-20 19:58:06,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {495#false} assume !(0 == ~p_dw_st~0); {495#false} is VALID [2022-02-20 19:58:06,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {495#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; {495#false} is VALID [2022-02-20 19:58:06,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {495#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; {495#false} is VALID [2022-02-20 19:58:06,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {495#false} assume !(0 == ~c_dr_pc~0); {495#false} is VALID [2022-02-20 19:58:06,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {495#false} assume 1 == ~c_dr_pc~0; {495#false} is VALID [2022-02-20 19:58:06,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {495#false} do_read_c_~a~0#1 := ~a_t~0; {495#false} is VALID [2022-02-20 19:58:06,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {495#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; {495#false} is VALID [2022-02-20 19:58:06,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {495#false} assume !(~p_last_write~0 == ~c_last_read~0); {495#false} is VALID [2022-02-20 19:58:06,466 INFO L272 TraceCheckUtils]: 63: Hoare triple {495#false} call error1(); {495#false} is VALID [2022-02-20 19:58:06,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {495#false} assume !false; {495#false} is VALID [2022-02-20 19:58:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:06,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:06,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526690003] [2022-02-20 19:58:06,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526690003] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:06,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:06,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:06,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431500414] [2022-02-20 19:58:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:06,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:06,480 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:58:06,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:06,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:06,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:06,552 INFO L87 Difference]: Start difference. First operand has 491 states, 431 states have (on average 1.6450116009280742) internal successors, (709), 439 states have internal predecessors, (709), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,768 INFO L93 Difference]: Finished difference Result 1088 states and 1744 transitions. [2022-02-20 19:58:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1744 transitions. [2022-02-20 19:58:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1744 transitions. [2022-02-20 19:58:09,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1744 transitions. [2022-02-20 19:58:10,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1744 edges. 1744 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,901 INFO L225 Difference]: With dead ends: 1088 [2022-02-20 19:58:10,902 INFO L226 Difference]: Without dead ends: 615 [2022-02-20 19:58:10,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:10,913 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 1212 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:10,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1217 Valid, 2509 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-02-20 19:58:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 576. [2022-02-20 19:58:10,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:10,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:10,993 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:10,996 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:11,022 INFO L93 Difference]: Finished difference Result 615 states and 925 transitions. [2022-02-20 19:58:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 925 transitions. [2022-02-20 19:58:11,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:11,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:11,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 615 states. [2022-02-20 19:58:11,035 INFO L87 Difference]: Start difference. First operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 615 states. [2022-02-20 19:58:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:11,068 INFO L93 Difference]: Finished difference Result 615 states and 925 transitions. [2022-02-20 19:58:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 925 transitions. [2022-02-20 19:58:11,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:11,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:11,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:11,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 499 states have (on average 1.531062124248497) internal successors, (764), 506 states have internal predecessors, (764), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 871 transitions. [2022-02-20 19:58:11,097 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 871 transitions. Word has length 65 [2022-02-20 19:58:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:11,101 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 871 transitions. [2022-02-20 19:58:11,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 871 transitions. [2022-02-20 19:58:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:11,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:11,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:11,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:11,105 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -713270806, now seen corresponding path program 1 times [2022-02-20 19:58:11,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:11,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221817285] [2022-02-20 19:58:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {4032#(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); {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3994#(= ~q_write_ev~0 ~q_read_ev~0)} #1913#return; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {4033#(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); {4034#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {4034#(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; {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3994#(= ~q_write_ev~0 ~q_read_ev~0)} #1915#return; {3993#false} is VALID [2022-02-20 19:58:11,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {3992#true} havoc ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} assume !(1 == ~p_dw_pc~0); {3992#true} is VALID [2022-02-20 19:58:11,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} ~__retres1~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {3992#true} #res := ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,260 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3992#true} {3992#true} #1909#return; {3992#true} is VALID [2022-02-20 19:58:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {3992#true} havoc ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} assume 1 == ~c_dr_pc~0; {3992#true} is VALID [2022-02-20 19:58:11,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {3992#true} #res := ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3992#true} {3992#true} #1911#return; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {4036#(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; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L272 TraceCheckUtils]: 1: Hoare triple {3992#true} call #t~ret8 := is_do_write_p_triggered(); {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} havoc ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {3992#true} assume !(1 == ~p_dw_pc~0); {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {3992#true} ~__retres1~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {3992#true} #res := ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3992#true} {3992#true} #1909#return; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {3992#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3992#true} is VALID [2022-02-20 19:58:11,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {3992#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L272 TraceCheckUtils]: 10: Hoare triple {3992#true} call #t~ret9 := is_do_read_c_triggered(); {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {3992#true} havoc ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {3992#true} assume 1 == ~c_dr_pc~0; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {3992#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {3992#true} #res := ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3992#true} {3992#true} #1911#return; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {3992#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {3992#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,264 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3992#true} {3993#false} #1917#return; {3993#false} is VALID [2022-02-20 19:58:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {4033#(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); {3992#true} is VALID [2022-02-20 19:58:11,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3992#true} is VALID [2022-02-20 19:58:11,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3992#true} {3993#false} #1919#return; {3993#false} is VALID [2022-02-20 19:58:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {3992#true} havoc ~__retres1~2; {3992#true} is VALID [2022-02-20 19:58:11,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3992#true} is VALID [2022-02-20 19:58:11,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} #res := ~__retres1~2; {3992#true} is VALID [2022-02-20 19:58:11,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,285 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3992#true} {3993#false} #1921#return; {3993#false} is VALID [2022-02-20 19:58:11,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {3992#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3992#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {3992#true} is VALID [2022-02-20 19:58:11,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {3992#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {3994#(= ~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; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {4032#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:11,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {4032#(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); {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3994#(= ~q_write_ev~0 ~q_read_ev~0)} #1913#return; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3994#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:11,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {3994#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {4033#(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); {4034#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {4034#(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; {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:11,290 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4035#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3994#(= ~q_write_ev~0 ~q_read_ev~0)} #1915#return; {3993#false} is VALID [2022-02-20 19:58:11,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {3993#false} call activate_threads1(); {4036#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:11,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#(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; {3992#true} is VALID [2022-02-20 19:58:11,290 INFO L272 TraceCheckUtils]: 19: Hoare triple {3992#true} call #t~ret8 := is_do_write_p_triggered(); {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {3992#true} havoc ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {3992#true} assume !(1 == ~p_dw_pc~0); {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {3992#true} ~__retres1~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {3992#true} #res := ~__retres1~0; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3992#true} {3992#true} #1909#return; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {3992#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {3992#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L272 TraceCheckUtils]: 28: Hoare triple {3992#true} call #t~ret9 := is_do_read_c_triggered(); {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {3992#true} havoc ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {3992#true} assume 1 == ~c_dr_pc~0; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {3992#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {3992#true} #res := ~__retres1~1; {3992#true} is VALID [2022-02-20 19:58:11,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3992#true} {3992#true} #1911#return; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {3992#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {3992#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3992#true} {3993#false} #1917#return; {3993#false} is VALID [2022-02-20 19:58:11,292 INFO L272 TraceCheckUtils]: 39: Hoare triple {3993#false} call reset_delta_events1(); {4033#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {4033#(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); {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {3992#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,292 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3992#true} {3993#false} #1919#return; {3993#false} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {3993#false} assume !false; {3993#false} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 45: Hoare triple {3993#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; {3993#false} is VALID [2022-02-20 19:58:11,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {3993#false} assume !false; {3993#false} is VALID [2022-02-20 19:58:11,292 INFO L272 TraceCheckUtils]: 47: Hoare triple {3993#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3992#true} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {3992#true} havoc ~__retres1~2; {3992#true} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {3992#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3992#true} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {3992#true} #res := ~__retres1~2; {3992#true} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {3992#true} assume true; {3992#true} is VALID [2022-02-20 19:58:11,293 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3992#true} {3993#false} #1921#return; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {3993#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; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {3993#false} assume 0 != eval1_~tmp___1~0#1; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {3993#false} assume !(0 == ~p_dw_st~0); {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {3993#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; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {3993#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; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {3993#false} assume !(0 == ~c_dr_pc~0); {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {3993#false} assume 1 == ~c_dr_pc~0; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {3993#false} do_read_c_~a~0#1 := ~a_t~0; {3993#false} is VALID [2022-02-20 19:58:11,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {3993#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; {3993#false} is VALID [2022-02-20 19:58:11,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {3993#false} assume !(~p_last_write~0 == ~c_last_read~0); {3993#false} is VALID [2022-02-20 19:58:11,294 INFO L272 TraceCheckUtils]: 63: Hoare triple {3993#false} call error1(); {3993#false} is VALID [2022-02-20 19:58:11,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {3993#false} assume !false; {3993#false} is VALID [2022-02-20 19:58:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:11,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:11,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221817285] [2022-02-20 19:58:11,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221817285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:11,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:11,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:11,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615938130] [2022-02-20 19:58:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:11,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:11,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:11,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:11,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:11,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:11,348 INFO L87 Difference]: Start difference. First operand 576 states and 871 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,551 INFO L93 Difference]: Finished difference Result 923 states and 1348 transitions. [2022-02-20 19:58:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1077 transitions. [2022-02-20 19:58:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1077 transitions. [2022-02-20 19:58:14,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1077 transitions. [2022-02-20 19:58:15,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1077 edges. 1077 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,281 INFO L225 Difference]: With dead ends: 923 [2022-02-20 19:58:15,281 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 19:58:15,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:15,283 INFO L933 BasicCegarLoop]: 784 mSDtfsCounter, 1846 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:15,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1878 Valid, 2362 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 19:58:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 672. [2022-02-20 19:58:15,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:15,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:15,336 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:15,337 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,380 INFO L93 Difference]: Finished difference Result 746 states and 1108 transitions. [2022-02-20 19:58:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1108 transitions. [2022-02-20 19:58:15,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 746 states. [2022-02-20 19:58:15,386 INFO L87 Difference]: Start difference. First operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 746 states. [2022-02-20 19:58:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,414 INFO L93 Difference]: Finished difference Result 746 states and 1108 transitions. [2022-02-20 19:58:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1108 transitions. [2022-02-20 19:58:15,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:15,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 575 states have (on average 1.5095652173913043) internal successors, (868), 584 states have internal predecessors, (868), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1005 transitions. [2022-02-20 19:58:15,446 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1005 transitions. Word has length 65 [2022-02-20 19:58:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:15,448 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1005 transitions. [2022-02-20 19:58:15,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1005 transitions. [2022-02-20 19:58:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:15,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:15,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:15,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:15,450 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1553110380, now seen corresponding path program 1 times [2022-02-20 19:58:15,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:15,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901035565] [2022-02-20 19:58:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {7722#(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); {7683#true} is VALID [2022-02-20 19:58:15,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7683#true} {7683#true} #1913#return; {7683#true} is VALID [2022-02-20 19:58:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {7723#(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); {7683#true} is VALID [2022-02-20 19:58:15,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume !(0 == ~q_write_ev~0); {7683#true} is VALID [2022-02-20 19:58:15,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7683#true} {7683#true} #1915#return; {7683#true} is VALID [2022-02-20 19:58:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {7683#true} havoc ~__retres1~0; {7683#true} is VALID [2022-02-20 19:58:15,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume !(1 == ~p_dw_pc~0); {7683#true} is VALID [2022-02-20 19:58:15,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} ~__retres1~0 := 0; {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,602 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7683#true} #1909#return; {7731#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {7683#true} havoc ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume 1 == ~c_dr_pc~0; {7683#true} is VALID [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7683#true} is VALID [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {7683#true} #res := ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,606 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7683#true} {7684#false} #1911#return; {7684#false} is VALID [2022-02-20 19:58:15,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {7724#(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; {7683#true} is VALID [2022-02-20 19:58:15,607 INFO L272 TraceCheckUtils]: 1: Hoare triple {7683#true} call #t~ret8 := is_do_write_p_triggered(); {7683#true} is VALID [2022-02-20 19:58:15,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} havoc ~__retres1~0; {7683#true} is VALID [2022-02-20 19:58:15,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {7683#true} assume !(1 == ~p_dw_pc~0); {7683#true} is VALID [2022-02-20 19:58:15,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {7683#true} ~__retres1~0 := 0; {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,612 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7683#true} #1909#return; {7731#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {7731#(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; {7732#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {7732#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7684#false} is VALID [2022-02-20 19:58:15,613 INFO L272 TraceCheckUtils]: 10: Hoare triple {7684#false} call #t~ret9 := is_do_read_c_triggered(); {7683#true} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {7683#true} havoc ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {7683#true} assume 1 == ~c_dr_pc~0; {7683#true} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {7683#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7683#true} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {7683#true} #res := ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,614 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7683#true} {7684#false} #1911#return; {7684#false} is VALID [2022-02-20 19:58:15,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {7684#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7684#false} is VALID [2022-02-20 19:58:15,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {7684#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7684#false} is VALID [2022-02-20 19:58:15,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {7684#false} assume true; {7684#false} is VALID [2022-02-20 19:58:15,614 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7684#false} {7683#true} #1917#return; {7684#false} is VALID [2022-02-20 19:58:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {7723#(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); {7683#true} is VALID [2022-02-20 19:58:15,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7683#true} is VALID [2022-02-20 19:58:15,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7683#true} {7684#false} #1919#return; {7684#false} is VALID [2022-02-20 19:58:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {7683#true} havoc ~__retres1~2; {7683#true} is VALID [2022-02-20 19:58:15,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7683#true} is VALID [2022-02-20 19:58:15,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} #res := ~__retres1~2; {7683#true} is VALID [2022-02-20 19:58:15,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,623 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7683#true} {7684#false} #1921#return; {7684#false} is VALID [2022-02-20 19:58:15,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {7683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {7683#true} is VALID [2022-02-20 19:58:15,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {7683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {7683#true} is VALID [2022-02-20 19:58:15,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {7683#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {7683#true} is VALID [2022-02-20 19:58:15,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {7683#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; {7683#true} is VALID [2022-02-20 19:58:15,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {7683#true} call update_channels1(); {7722#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:15,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {7722#(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); {7683#true} is VALID [2022-02-20 19:58:15,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,624 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7683#true} {7683#true} #1913#return; {7683#true} is VALID [2022-02-20 19:58:15,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {7683#true} assume { :begin_inline_init_threads1 } true; {7683#true} is VALID [2022-02-20 19:58:15,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {7683#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7683#true} is VALID [2022-02-20 19:58:15,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {7683#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7683#true} is VALID [2022-02-20 19:58:15,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {7683#true} assume { :end_inline_init_threads1 } true; {7683#true} is VALID [2022-02-20 19:58:15,625 INFO L272 TraceCheckUtils]: 12: Hoare triple {7683#true} call fire_delta_events1(); {7723#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7723#(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); {7683#true} is VALID [2022-02-20 19:58:15,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {7683#true} assume !(0 == ~q_write_ev~0); {7683#true} is VALID [2022-02-20 19:58:15,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,626 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7683#true} {7683#true} #1915#return; {7683#true} is VALID [2022-02-20 19:58:15,626 INFO L272 TraceCheckUtils]: 17: Hoare triple {7683#true} call activate_threads1(); {7724#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:15,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {7724#(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; {7683#true} is VALID [2022-02-20 19:58:15,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {7683#true} call #t~ret8 := is_do_write_p_triggered(); {7683#true} is VALID [2022-02-20 19:58:15,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {7683#true} havoc ~__retres1~0; {7683#true} is VALID [2022-02-20 19:58:15,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {7683#true} assume !(1 == ~p_dw_pc~0); {7683#true} is VALID [2022-02-20 19:58:15,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {7683#true} ~__retres1~0 := 0; {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:15,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {7739#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:15,628 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7740#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7683#true} #1909#return; {7731#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:15,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {7731#(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; {7732#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:15,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {7732#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7684#false} is VALID [2022-02-20 19:58:15,629 INFO L272 TraceCheckUtils]: 28: Hoare triple {7684#false} call #t~ret9 := is_do_read_c_triggered(); {7683#true} is VALID [2022-02-20 19:58:15,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {7683#true} havoc ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {7683#true} assume 1 == ~c_dr_pc~0; {7683#true} is VALID [2022-02-20 19:58:15,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {7683#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7683#true} is VALID [2022-02-20 19:58:15,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {7683#true} #res := ~__retres1~1; {7683#true} is VALID [2022-02-20 19:58:15,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,630 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7683#true} {7684#false} #1911#return; {7684#false} is VALID [2022-02-20 19:58:15,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {7684#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7684#false} is VALID [2022-02-20 19:58:15,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {7684#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7684#false} is VALID [2022-02-20 19:58:15,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {7684#false} assume true; {7684#false} is VALID [2022-02-20 19:58:15,630 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7684#false} {7683#true} #1917#return; {7684#false} is VALID [2022-02-20 19:58:15,630 INFO L272 TraceCheckUtils]: 39: Hoare triple {7684#false} call reset_delta_events1(); {7723#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {7723#(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); {7683#true} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {7683#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7683#true} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,631 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7683#true} {7684#false} #1919#return; {7684#false} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {7684#false} assume !false; {7684#false} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {7684#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; {7684#false} is VALID [2022-02-20 19:58:15,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {7684#false} assume !false; {7684#false} is VALID [2022-02-20 19:58:15,632 INFO L272 TraceCheckUtils]: 47: Hoare triple {7684#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7683#true} is VALID [2022-02-20 19:58:15,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {7683#true} havoc ~__retres1~2; {7683#true} is VALID [2022-02-20 19:58:15,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {7683#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7683#true} is VALID [2022-02-20 19:58:15,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {7683#true} #res := ~__retres1~2; {7683#true} is VALID [2022-02-20 19:58:15,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {7683#true} assume true; {7683#true} is VALID [2022-02-20 19:58:15,632 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7683#true} {7684#false} #1921#return; {7684#false} is VALID [2022-02-20 19:58:15,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {7684#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; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {7684#false} assume 0 != eval1_~tmp___1~0#1; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {7684#false} assume !(0 == ~p_dw_st~0); {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {7684#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; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {7684#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; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {7684#false} assume !(0 == ~c_dr_pc~0); {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {7684#false} assume 1 == ~c_dr_pc~0; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {7684#false} do_read_c_~a~0#1 := ~a_t~0; {7684#false} is VALID [2022-02-20 19:58:15,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {7684#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; {7684#false} is VALID [2022-02-20 19:58:15,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {7684#false} assume !(~p_last_write~0 == ~c_last_read~0); {7684#false} is VALID [2022-02-20 19:58:15,634 INFO L272 TraceCheckUtils]: 63: Hoare triple {7684#false} call error1(); {7684#false} is VALID [2022-02-20 19:58:15,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {7684#false} assume !false; {7684#false} is VALID [2022-02-20 19:58:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:15,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:15,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901035565] [2022-02-20 19:58:15,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901035565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:15,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:15,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:15,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417397522] [2022-02-20 19:58:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:15,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:15,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:15,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:15,668 INFO L87 Difference]: Start difference. First operand 672 states and 1005 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,286 INFO L93 Difference]: Finished difference Result 973 states and 1419 transitions. [2022-02-20 19:58:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 895 transitions. [2022-02-20 19:58:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 895 transitions. [2022-02-20 19:58:19,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 895 transitions. [2022-02-20 19:58:19,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 895 edges. 895 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:19,862 INFO L225 Difference]: With dead ends: 973 [2022-02-20 19:58:19,862 INFO L226 Difference]: Without dead ends: 706 [2022-02-20 19:58:19,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:19,868 INFO L933 BasicCegarLoop]: 727 mSDtfsCounter, 652 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:19,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 3237 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-02-20 19:58:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 677. [2022-02-20 19:58:19,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:19,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:19,893 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:19,895 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,915 INFO L93 Difference]: Finished difference Result 706 states and 1049 transitions. [2022-02-20 19:58:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1049 transitions. [2022-02-20 19:58:19,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 706 states. [2022-02-20 19:58:19,920 INFO L87 Difference]: Start difference. First operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 706 states. [2022-02-20 19:58:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,940 INFO L93 Difference]: Finished difference Result 706 states and 1049 transitions. [2022-02-20 19:58:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1049 transitions. [2022-02-20 19:58:19,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:19,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 579 states have (on average 1.5025906735751295) internal successors, (870), 588 states have internal predecessors, (870), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1008 transitions. [2022-02-20 19:58:19,972 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1008 transitions. Word has length 65 [2022-02-20 19:58:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,973 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 1008 transitions. [2022-02-20 19:58:19,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1008 transitions. [2022-02-20 19:58:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:19,976 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:19,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:19,976 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 523751082, now seen corresponding path program 1 times [2022-02-20 19:58:19,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341312521] [2022-02-20 19:58:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {11401#(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); {11402#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:20,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {11402#(not (= |old(~q_req_up~0)| 1))} assume true; {11402#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:20,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11402#(not (= |old(~q_req_up~0)| 1))} {11362#(= ~c_dr_pc~0 ~q_req_up~0)} #1913#return; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {11403#(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); {11359#true} is VALID [2022-02-20 19:58:20,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#true} assume !(0 == ~q_write_ev~0); {11359#true} is VALID [2022-02-20 19:58:20,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11359#true} {11366#(not (= ~c_dr_pc~0 1))} #1915#return; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {11359#true} havoc ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#true} assume !(1 == ~p_dw_pc~0); {11359#true} is VALID [2022-02-20 19:58:20,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#true} ~__retres1~0 := 0; {11359#true} is VALID [2022-02-20 19:58:20,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {11359#true} #res := ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,090 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11359#true} {11359#true} #1909#return; {11359#true} is VALID [2022-02-20 19:58:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {11359#true} havoc ~__retres1~1; {11359#true} is VALID [2022-02-20 19:58:20,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#true} assume 1 == ~c_dr_pc~0; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,097 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} {11359#true} #1911#return; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {11404#(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; {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L272 TraceCheckUtils]: 1: Hoare triple {11359#true} call #t~ret8 := is_do_write_p_triggered(); {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#true} havoc ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {11359#true} assume !(1 == ~p_dw_pc~0); {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {11359#true} ~__retres1~0 := 0; {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {11359#true} #res := ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,098 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11359#true} {11359#true} #1909#return; {11359#true} is VALID [2022-02-20 19:58:20,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {11359#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11359#true} is VALID [2022-02-20 19:58:20,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {11359#true} assume !(0 != ~tmp~1); {11359#true} is VALID [2022-02-20 19:58:20,098 INFO L272 TraceCheckUtils]: 10: Hoare triple {11359#true} call #t~ret9 := is_do_read_c_triggered(); {11359#true} is VALID [2022-02-20 19:58:20,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {11359#true} havoc ~__retres1~1; {11359#true} is VALID [2022-02-20 19:58:20,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {11359#true} assume 1 == ~c_dr_pc~0; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,110 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} {11359#true} #1911#return; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,114 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} {11366#(not (= ~c_dr_pc~0 1))} #1917#return; {11360#false} is VALID [2022-02-20 19:58:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {11403#(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); {11359#true} is VALID [2022-02-20 19:58:20,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11359#true} is VALID [2022-02-20 19:58:20,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11359#true} {11360#false} #1919#return; {11360#false} is VALID [2022-02-20 19:58:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:20,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {11359#true} havoc ~__retres1~2; {11359#true} is VALID [2022-02-20 19:58:20,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11359#true} is VALID [2022-02-20 19:58:20,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#true} #res := ~__retres1~2; {11359#true} is VALID [2022-02-20 19:58:20,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,124 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11359#true} {11360#false} #1921#return; {11360#false} is VALID [2022-02-20 19:58:20,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {11359#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {11361#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:20,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {11361#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {11361#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:20,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {11361#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {11362#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:20,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {11362#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {11362#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:20,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {11362#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {11401#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:20,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {11401#(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); {11402#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:20,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {11402#(not (= |old(~q_req_up~0)| 1))} assume true; {11402#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:20,127 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11402#(not (= |old(~q_req_up~0)| 1))} {11362#(= ~c_dr_pc~0 ~q_req_up~0)} #1913#return; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,129 INFO L272 TraceCheckUtils]: 12: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {11403#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:20,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#(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); {11359#true} is VALID [2022-02-20 19:58:20,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {11359#true} assume !(0 == ~q_write_ev~0); {11359#true} is VALID [2022-02-20 19:58:20,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,129 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11359#true} {11366#(not (= ~c_dr_pc~0 1))} #1915#return; {11366#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:20,130 INFO L272 TraceCheckUtils]: 17: Hoare triple {11366#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {11404#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {11404#(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; {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {11359#true} call #t~ret8 := is_do_write_p_triggered(); {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {11359#true} havoc ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {11359#true} assume !(1 == ~p_dw_pc~0); {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {11359#true} ~__retres1~0 := 0; {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {11359#true} #res := ~__retres1~0; {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,130 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11359#true} {11359#true} #1909#return; {11359#true} is VALID [2022-02-20 19:58:20,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {11359#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11359#true} is VALID [2022-02-20 19:58:20,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {11359#true} assume !(0 != ~tmp~1); {11359#true} is VALID [2022-02-20 19:58:20,131 INFO L272 TraceCheckUtils]: 28: Hoare triple {11359#true} call #t~ret9 := is_do_read_c_triggered(); {11359#true} is VALID [2022-02-20 19:58:20,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {11359#true} havoc ~__retres1~1; {11359#true} is VALID [2022-02-20 19:58:20,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {11359#true} assume 1 == ~c_dr_pc~0; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,132 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} {11359#true} #1911#return; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:20,133 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11417#(= (+ (- 1) ~c_dr_pc~0) 0)} {11366#(not (= ~c_dr_pc~0 1))} #1917#return; {11360#false} is VALID [2022-02-20 19:58:20,133 INFO L272 TraceCheckUtils]: 39: Hoare triple {11360#false} call reset_delta_events1(); {11403#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {11403#(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); {11359#true} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {11359#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11359#true} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,134 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11359#true} {11360#false} #1919#return; {11360#false} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {11360#false} assume !false; {11360#false} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {11360#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; {11360#false} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {11360#false} assume !false; {11360#false} is VALID [2022-02-20 19:58:20,134 INFO L272 TraceCheckUtils]: 47: Hoare triple {11360#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11359#true} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {11359#true} havoc ~__retres1~2; {11359#true} is VALID [2022-02-20 19:58:20,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {11359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11359#true} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {11359#true} #res := ~__retres1~2; {11359#true} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {11359#true} assume true; {11359#true} is VALID [2022-02-20 19:58:20,135 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11359#true} {11360#false} #1921#return; {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {11360#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; {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {11360#false} assume 0 != eval1_~tmp___1~0#1; {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {11360#false} assume !(0 == ~p_dw_st~0); {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {11360#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; {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {11360#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; {11360#false} is VALID [2022-02-20 19:58:20,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {11360#false} assume !(0 == ~c_dr_pc~0); {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {11360#false} assume 1 == ~c_dr_pc~0; {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {11360#false} do_read_c_~a~0#1 := ~a_t~0; {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {11360#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; {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {11360#false} assume !(~p_last_write~0 == ~c_last_read~0); {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L272 TraceCheckUtils]: 63: Hoare triple {11360#false} call error1(); {11360#false} is VALID [2022-02-20 19:58:20,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {11360#false} assume !false; {11360#false} is VALID [2022-02-20 19:58:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:20,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:20,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341312521] [2022-02-20 19:58:20,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341312521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:20,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:20,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:20,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235469077] [2022-02-20 19:58:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:20,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:20,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:20,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:20,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:20,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:20,173 INFO L87 Difference]: Start difference. First operand 677 states and 1008 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:26,044 INFO L93 Difference]: Finished difference Result 1999 states and 2804 transitions. [2022-02-20 19:58:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:58:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1413 transitions. [2022-02-20 19:58:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1413 transitions. [2022-02-20 19:58:26,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1413 transitions. [2022-02-20 19:58:27,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1413 edges. 1413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:27,169 INFO L225 Difference]: With dead ends: 1999 [2022-02-20 19:58:27,170 INFO L226 Difference]: Without dead ends: 1709 [2022-02-20 19:58:27,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:27,178 INFO L933 BasicCegarLoop]: 829 mSDtfsCounter, 3640 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3654 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:27,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3654 Valid, 3023 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:58:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2022-02-20 19:58:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1578. [2022-02-20 19:58:27,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:27,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1709 states. Second operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:27,254 INFO L74 IsIncluded]: Start isIncluded. First operand 1709 states. Second operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:27,256 INFO L87 Difference]: Start difference. First operand 1709 states. Second operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,357 INFO L93 Difference]: Finished difference Result 1709 states and 2298 transitions. [2022-02-20 19:58:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2298 transitions. [2022-02-20 19:58:27,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:27,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:27,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1709 states. [2022-02-20 19:58:27,365 INFO L87 Difference]: Start difference. First operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1709 states. [2022-02-20 19:58:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,462 INFO L93 Difference]: Finished difference Result 1709 states and 2298 transitions. [2022-02-20 19:58:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2298 transitions. [2022-02-20 19:58:27,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:27,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:27,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:27,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1294 states have (on average 1.3979907264296754) internal successors, (1809), 1318 states have internal predecessors, (1809), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2149 transitions. [2022-02-20 19:58:27,596 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2149 transitions. Word has length 65 [2022-02-20 19:58:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:27,597 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2149 transitions. [2022-02-20 19:58:27,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2149 transitions. [2022-02-20 19:58:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:27,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:27,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:27,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:27,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash 116960512, now seen corresponding path program 1 times [2022-02-20 19:58:27,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:27,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863099900] [2022-02-20 19:58:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {19728#(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); {19689#true} is VALID [2022-02-20 19:58:27,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19689#true} {19689#true} #1913#return; {19689#true} is VALID [2022-02-20 19:58:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {19729#(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); {19689#true} is VALID [2022-02-20 19:58:27,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume !(0 == ~q_write_ev~0); {19689#true} is VALID [2022-02-20 19:58:27,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19689#true} {19689#true} #1915#return; {19689#true} is VALID [2022-02-20 19:58:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {19689#true} havoc ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume !(1 == ~p_dw_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} ~__retres1~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {19689#true} #res := ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,686 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19689#true} {19689#true} #1909#return; {19689#true} is VALID [2022-02-20 19:58:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {19689#true} havoc ~__retres1~1; {19689#true} is VALID [2022-02-20 19:58:27,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume !(1 == ~c_dr_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} ~__retres1~1 := 0; {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,714 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19689#true} #1911#return; {19743#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {19730#(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; {19689#true} is VALID [2022-02-20 19:58:27,715 INFO L272 TraceCheckUtils]: 1: Hoare triple {19689#true} call #t~ret8 := is_do_write_p_triggered(); {19689#true} is VALID [2022-02-20 19:58:27,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} havoc ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {19689#true} assume !(1 == ~p_dw_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {19689#true} ~__retres1~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {19689#true} #res := ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19689#true} {19689#true} #1909#return; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {19689#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {19689#true} assume !(0 != ~tmp~1); {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L272 TraceCheckUtils]: 10: Hoare triple {19689#true} call #t~ret9 := is_do_read_c_triggered(); {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {19689#true} havoc ~__retres1~1; {19689#true} is VALID [2022-02-20 19:58:27,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {19689#true} assume !(1 == ~c_dr_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {19689#true} ~__retres1~1 := 0; {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,718 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19689#true} #1911#return; {19743#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {19743#(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; {19744#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:27,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {19744#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19690#false} is VALID [2022-02-20 19:58:27,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {19690#false} assume true; {19690#false} is VALID [2022-02-20 19:58:27,719 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19690#false} {19689#true} #1917#return; {19690#false} is VALID [2022-02-20 19:58:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {19729#(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); {19689#true} is VALID [2022-02-20 19:58:27,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19689#true} is VALID [2022-02-20 19:58:27,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19689#true} {19690#false} #1919#return; {19690#false} is VALID [2022-02-20 19:58:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:27,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {19689#true} havoc ~__retres1~2; {19689#true} is VALID [2022-02-20 19:58:27,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19689#true} is VALID [2022-02-20 19:58:27,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} #res := ~__retres1~2; {19689#true} is VALID [2022-02-20 19:58:27,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,727 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19689#true} {19690#false} #1921#return; {19690#false} is VALID [2022-02-20 19:58:27,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {19689#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {19689#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {19689#true} is VALID [2022-02-20 19:58:27,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {19689#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {19689#true} is VALID [2022-02-20 19:58:27,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {19689#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; {19689#true} is VALID [2022-02-20 19:58:27,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {19689#true} call update_channels1(); {19728#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:27,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {19728#(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); {19689#true} is VALID [2022-02-20 19:58:27,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,728 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19689#true} {19689#true} #1913#return; {19689#true} is VALID [2022-02-20 19:58:27,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {19689#true} assume { :begin_inline_init_threads1 } true; {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {19689#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {19689#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {19689#true} assume { :end_inline_init_threads1 } true; {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L272 TraceCheckUtils]: 12: Hoare triple {19689#true} call fire_delta_events1(); {19729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {19729#(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); {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {19689#true} assume !(0 == ~q_write_ev~0); {19689#true} is VALID [2022-02-20 19:58:27,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19689#true} {19689#true} #1915#return; {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L272 TraceCheckUtils]: 17: Hoare triple {19689#true} call activate_threads1(); {19730#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:27,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {19730#(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; {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {19689#true} call #t~ret8 := is_do_write_p_triggered(); {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {19689#true} havoc ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {19689#true} assume !(1 == ~p_dw_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {19689#true} ~__retres1~0 := 0; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {19689#true} #res := ~__retres1~0; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19689#true} {19689#true} #1909#return; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {19689#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {19689#true} assume !(0 != ~tmp~1); {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L272 TraceCheckUtils]: 28: Hoare triple {19689#true} call #t~ret9 := is_do_read_c_triggered(); {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {19689#true} havoc ~__retres1~1; {19689#true} is VALID [2022-02-20 19:58:27,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {19689#true} assume !(1 == ~c_dr_pc~0); {19689#true} is VALID [2022-02-20 19:58:27,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {19689#true} ~__retres1~1 := 0; {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:27,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {19745#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:27,733 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19746#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19689#true} #1911#return; {19743#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:27,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {19743#(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; {19744#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:27,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {19744#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {19690#false} assume true; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19690#false} {19689#true} #1917#return; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L272 TraceCheckUtils]: 39: Hoare triple {19690#false} call reset_delta_events1(); {19729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {19729#(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); {19689#true} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {19689#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19689#true} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,734 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19689#true} {19690#false} #1919#return; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {19690#false} assume !false; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {19690#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; {19690#false} is VALID [2022-02-20 19:58:27,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {19690#false} assume !false; {19690#false} is VALID [2022-02-20 19:58:27,735 INFO L272 TraceCheckUtils]: 47: Hoare triple {19690#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19689#true} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {19689#true} havoc ~__retres1~2; {19689#true} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {19689#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19689#true} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {19689#true} #res := ~__retres1~2; {19689#true} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {19689#true} assume true; {19689#true} is VALID [2022-02-20 19:58:27,735 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19689#true} {19690#false} #1921#return; {19690#false} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {19690#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; {19690#false} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {19690#false} assume 0 != eval1_~tmp___1~0#1; {19690#false} is VALID [2022-02-20 19:58:27,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {19690#false} assume !(0 == ~p_dw_st~0); {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {19690#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; {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {19690#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; {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {19690#false} assume 0 == ~c_dr_pc~0; {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {19690#false} assume !false; {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {19690#false} assume !(1 == ~q_free~0); {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {19690#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; {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {19690#false} assume !(~p_last_write~0 == ~c_last_read~0); {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L272 TraceCheckUtils]: 63: Hoare triple {19690#false} call error1(); {19690#false} is VALID [2022-02-20 19:58:27,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {19690#false} assume !false; {19690#false} is VALID [2022-02-20 19:58:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:27,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:27,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863099900] [2022-02-20 19:58:27,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863099900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:27,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:27,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:27,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78406143] [2022-02-20 19:58:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:27,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:27,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:27,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:27,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:27,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:27,772 INFO L87 Difference]: Start difference. First operand 1578 states and 2149 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,843 INFO L93 Difference]: Finished difference Result 2869 states and 3822 transitions. [2022-02-20 19:58:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 894 transitions. [2022-02-20 19:58:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 894 transitions. [2022-02-20 19:58:30,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 894 transitions. [2022-02-20 19:58:31,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 894 edges. 894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:31,586 INFO L225 Difference]: With dead ends: 2869 [2022-02-20 19:58:31,586 INFO L226 Difference]: Without dead ends: 1684 [2022-02-20 19:58:31,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:31,589 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 972 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:31,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 2897 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-02-20 19:58:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1608. [2022-02-20 19:58:31,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:31,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1684 states. Second operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:31,666 INFO L74 IsIncluded]: Start isIncluded. First operand 1684 states. Second operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:31,668 INFO L87 Difference]: Start difference. First operand 1684 states. Second operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,765 INFO L93 Difference]: Finished difference Result 1684 states and 2262 transitions. [2022-02-20 19:58:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2262 transitions. [2022-02-20 19:58:31,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1684 states. [2022-02-20 19:58:31,773 INFO L87 Difference]: Start difference. First operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1684 states. [2022-02-20 19:58:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,871 INFO L93 Difference]: Finished difference Result 1684 states and 2262 transitions. [2022-02-20 19:58:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2262 transitions. [2022-02-20 19:58:31,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:31,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1318 states have (on average 1.3846737481031866) internal successors, (1825), 1342 states have internal predecessors, (1825), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2171 transitions. [2022-02-20 19:58:32,017 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2171 transitions. Word has length 65 [2022-02-20 19:58:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:32,017 INFO L470 AbstractCegarLoop]: Abstraction has 1608 states and 2171 transitions. [2022-02-20 19:58:32,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2171 transitions. [2022-02-20 19:58:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:32,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:32,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:32,019 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1503163906, now seen corresponding path program 1 times [2022-02-20 19:58:32,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:32,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028944343] [2022-02-20 19:58:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {29164#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1913#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {29165#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {29165#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1915#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {29124#true} havoc ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {29124#true} assume !(1 == ~p_dw_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {29124#true} ~__retres1~0 := 0; {29124#true} is VALID [2022-02-20 19:58:32,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {29124#true} #res := ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,083 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29124#true} {29124#true} #1909#return; {29124#true} is VALID [2022-02-20 19:58:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {29124#true} havoc ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {29124#true} assume !(1 == ~c_dr_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {29124#true} ~__retres1~1 := 0; {29124#true} is VALID [2022-02-20 19:58:32,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {29124#true} #res := ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29124#true} {29124#true} #1911#return; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {29166#(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; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L272 TraceCheckUtils]: 1: Hoare triple {29124#true} call #t~ret8 := is_do_write_p_triggered(); {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {29124#true} havoc ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {29124#true} assume !(1 == ~p_dw_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {29124#true} ~__retres1~0 := 0; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {29124#true} #res := ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29124#true} {29124#true} #1909#return; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {29124#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {29124#true} assume !(0 != ~tmp~1); {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L272 TraceCheckUtils]: 10: Hoare triple {29124#true} call #t~ret9 := is_do_read_c_triggered(); {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {29124#true} havoc ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {29124#true} assume !(1 == ~c_dr_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {29124#true} ~__retres1~1 := 0; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {29124#true} #res := ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,088 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29124#true} {29124#true} #1911#return; {29124#true} is VALID [2022-02-20 19:58:32,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {29124#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29124#true} is VALID [2022-02-20 19:58:32,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {29124#true} assume !(0 != ~tmp___0~1); {29124#true} is VALID [2022-02-20 19:58:32,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,088 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29124#true} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1917#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {29165#(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); {29179#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:32,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {29179#(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; {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1919#return; {29125#false} is VALID [2022-02-20 19:58:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {29124#true} havoc ~__retres1~2; {29124#true} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {29124#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29124#true} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {29124#true} #res := ~__retres1~2; {29124#true} is VALID [2022-02-20 19:58:32,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,108 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29124#true} {29125#false} #1921#return; {29125#false} is VALID [2022-02-20 19:58:32,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {29124#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {29124#true} is VALID [2022-02-20 19:58:32,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {29124#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {29124#true} is VALID [2022-02-20 19:58:32,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {29124#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {29126#(= ~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; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29164#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {29164#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,111 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1913#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,112 INFO L272 TraceCheckUtils]: 12: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {29165#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {29165#(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); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,114 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1915#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,114 INFO L272 TraceCheckUtils]: 17: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29166#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {29166#(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; {29124#true} is VALID [2022-02-20 19:58:32,114 INFO L272 TraceCheckUtils]: 19: Hoare triple {29124#true} call #t~ret8 := is_do_write_p_triggered(); {29124#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {29124#true} havoc ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {29124#true} assume !(1 == ~p_dw_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {29124#true} ~__retres1~0 := 0; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {29124#true} #res := ~__retres1~0; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29124#true} {29124#true} #1909#return; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {29124#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {29124#true} assume !(0 != ~tmp~1); {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L272 TraceCheckUtils]: 28: Hoare triple {29124#true} call #t~ret9 := is_do_read_c_triggered(); {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {29124#true} havoc ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {29124#true} assume !(1 == ~c_dr_pc~0); {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {29124#true} ~__retres1~1 := 0; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {29124#true} #res := ~__retres1~1; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29124#true} {29124#true} #1911#return; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {29124#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {29124#true} assume !(0 != ~tmp___0~1); {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,116 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29124#true} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1917#return; {29126#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,117 INFO L272 TraceCheckUtils]: 39: Hoare triple {29126#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29165#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {29165#(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); {29179#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:32,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {29179#(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; {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:32,118 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29180#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29126#(= ~q_write_ev~0 ~q_read_ev~0)} #1919#return; {29125#false} is VALID [2022-02-20 19:58:32,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {29125#false} assume !false; {29125#false} is VALID [2022-02-20 19:58:32,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {29125#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; {29125#false} is VALID [2022-02-20 19:58:32,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {29125#false} assume !false; {29125#false} is VALID [2022-02-20 19:58:32,119 INFO L272 TraceCheckUtils]: 47: Hoare triple {29125#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29124#true} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {29124#true} havoc ~__retres1~2; {29124#true} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {29124#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29124#true} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {29124#true} #res := ~__retres1~2; {29124#true} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {29124#true} assume true; {29124#true} is VALID [2022-02-20 19:58:32,119 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29124#true} {29125#false} #1921#return; {29125#false} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {29125#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; {29125#false} is VALID [2022-02-20 19:58:32,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {29125#false} assume 0 != eval1_~tmp___1~0#1; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {29125#false} assume !(0 == ~p_dw_st~0); {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {29125#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; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {29125#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; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {29125#false} assume 0 == ~c_dr_pc~0; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {29125#false} assume !false; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {29125#false} assume !(1 == ~q_free~0); {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {29125#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; {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {29125#false} assume !(~p_last_write~0 == ~c_last_read~0); {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L272 TraceCheckUtils]: 63: Hoare triple {29125#false} call error1(); {29125#false} is VALID [2022-02-20 19:58:32,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {29125#false} assume !false; {29125#false} is VALID [2022-02-20 19:58:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:32,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:32,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028944343] [2022-02-20 19:58:32,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028944343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:32,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:32,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:32,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825689776] [2022-02-20 19:58:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:32,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:32,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:32,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:32,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:32,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:32,162 INFO L87 Difference]: Start difference. First operand 1608 states and 2171 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,387 INFO L93 Difference]: Finished difference Result 2863 states and 3718 transitions. [2022-02-20 19:58:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:35,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1052 transitions. [2022-02-20 19:58:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1052 transitions. [2022-02-20 19:58:35,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1052 transitions. [2022-02-20 19:58:36,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1052 edges. 1052 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,369 INFO L225 Difference]: With dead ends: 2863 [2022-02-20 19:58:36,369 INFO L226 Difference]: Without dead ends: 1871 [2022-02-20 19:58:36,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:36,371 INFO L933 BasicCegarLoop]: 732 mSDtfsCounter, 1787 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:36,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1816 Valid, 2149 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-02-20 19:58:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1550. [2022-02-20 19:58:36,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:36,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1871 states. Second operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:36,452 INFO L74 IsIncluded]: Start isIncluded. First operand 1871 states. Second operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:36,453 INFO L87 Difference]: Start difference. First operand 1871 states. Second operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,567 INFO L93 Difference]: Finished difference Result 1871 states and 2433 transitions. [2022-02-20 19:58:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2433 transitions. [2022-02-20 19:58:36,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1871 states. [2022-02-20 19:58:36,574 INFO L87 Difference]: Start difference. First operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1871 states. [2022-02-20 19:58:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,687 INFO L93 Difference]: Finished difference Result 1871 states and 2433 transitions. [2022-02-20 19:58:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2433 transitions. [2022-02-20 19:58:36,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:36,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1276 states have (on average 1.3824451410658307) internal successors, (1764), 1295 states have internal predecessors, (1764), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2089 transitions. [2022-02-20 19:58:36,800 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2089 transitions. Word has length 65 [2022-02-20 19:58:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:36,800 INFO L470 AbstractCegarLoop]: Abstraction has 1550 states and 2089 transitions. [2022-02-20 19:58:36,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2089 transitions. [2022-02-20 19:58:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:36,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:36,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:36,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:36,802 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1369150400, now seen corresponding path program 1 times [2022-02-20 19:58:36,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:36,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871374188] [2022-02-20 19:58:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {38856#(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); {38816#true} is VALID [2022-02-20 19:58:36,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38816#true} {38816#true} #1913#return; {38816#true} is VALID [2022-02-20 19:58:36,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {38857#(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); {38816#true} is VALID [2022-02-20 19:58:36,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume !(0 == ~q_write_ev~0); {38816#true} is VALID [2022-02-20 19:58:36,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38816#true} {38821#(= ~p_dw_st~0 0)} #1915#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {38816#true} havoc ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume !(1 == ~p_dw_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} ~__retres1~0 := 0; {38816#true} is VALID [2022-02-20 19:58:36,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {38816#true} #res := ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,869 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1909#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {38816#true} havoc ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume !(1 == ~c_dr_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} ~__retres1~1 := 0; {38816#true} is VALID [2022-02-20 19:58:36,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {38816#true} #res := ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,875 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1911#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {38858#(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; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,875 INFO L272 TraceCheckUtils]: 1: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38816#true} is VALID [2022-02-20 19:58:36,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} havoc ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {38816#true} assume !(1 == ~p_dw_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {38816#true} ~__retres1~0 := 0; {38816#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {38816#true} #res := ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,890 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1909#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,890 INFO L272 TraceCheckUtils]: 10: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {38816#true} havoc ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {38816#true} assume !(1 == ~c_dr_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {38816#true} ~__retres1~1 := 0; {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {38816#true} #res := ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,891 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1911#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,893 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38821#(= ~p_dw_st~0 0)} #1917#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {38857#(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); {38816#true} is VALID [2022-02-20 19:58:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume !(1 == ~q_write_ev~0); {38816#true} is VALID [2022-02-20 19:58:36,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38816#true} {38821#(= ~p_dw_st~0 0)} #1919#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {38816#true} havoc ~__retres1~2; {38816#true} is VALID [2022-02-20 19:58:36,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {38821#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {38821#(= ~p_dw_st~0 0)} assume true; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38821#(= ~p_dw_st~0 0)} {38821#(= ~p_dw_st~0 0)} #1921#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {38816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {38816#true} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {38816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {38816#true} is VALID [2022-02-20 19:58:36,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {38816#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {38816#true} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {38816#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; {38816#true} is VALID [2022-02-20 19:58:36,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {38816#true} call update_channels1(); {38856#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {38856#(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); {38816#true} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,904 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38816#true} {38816#true} #1913#return; {38816#true} is VALID [2022-02-20 19:58:36,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {38816#true} assume { :begin_inline_init_threads1 } true; {38816#true} is VALID [2022-02-20 19:58:36,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {38816#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {38821#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {38821#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {38821#(= ~p_dw_st~0 0)} call fire_delta_events1(); {38857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {38857#(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); {38816#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {38816#true} assume !(0 == ~q_write_ev~0); {38816#true} is VALID [2022-02-20 19:58:36,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38816#true} {38821#(= ~p_dw_st~0 0)} #1915#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,907 INFO L272 TraceCheckUtils]: 17: Hoare triple {38821#(= ~p_dw_st~0 0)} call activate_threads1(); {38858#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {38858#(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; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38816#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {38816#true} havoc ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {38816#true} assume !(1 == ~p_dw_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {38816#true} ~__retres1~0 := 0; {38816#true} is VALID [2022-02-20 19:58:36,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {38816#true} #res := ~__retres1~0; {38816#true} is VALID [2022-02-20 19:58:36,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,908 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1909#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,909 INFO L272 TraceCheckUtils]: 28: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38816#true} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {38816#true} havoc ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {38816#true} assume !(1 == ~c_dr_pc~0); {38816#true} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {38816#true} ~__retres1~1 := 0; {38816#true} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {38816#true} #res := ~__retres1~1; {38816#true} is VALID [2022-02-20 19:58:36,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,910 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38816#true} {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1911#return; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:36,911 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38859#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38821#(= ~p_dw_st~0 0)} #1917#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,911 INFO L272 TraceCheckUtils]: 39: Hoare triple {38821#(= ~p_dw_st~0 0)} call reset_delta_events1(); {38857#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {38857#(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); {38816#true} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {38816#true} assume !(1 == ~q_write_ev~0); {38816#true} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {38816#true} assume true; {38816#true} is VALID [2022-02-20 19:58:36,912 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {38816#true} {38821#(= ~p_dw_st~0 0)} #1919#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {38821#(= ~p_dw_st~0 0)} assume !false; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {38821#(= ~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; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {38821#(= ~p_dw_st~0 0)} assume !false; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,913 INFO L272 TraceCheckUtils]: 47: Hoare triple {38821#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38816#true} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {38816#true} havoc ~__retres1~2; {38816#true} is VALID [2022-02-20 19:58:36,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {38816#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {38821#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {38821#(= ~p_dw_st~0 0)} assume true; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,914 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38821#(= ~p_dw_st~0 0)} {38821#(= ~p_dw_st~0 0)} #1921#return; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {38821#(= ~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; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {38821#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {38821#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {38821#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {38817#false} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {38817#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; {38817#false} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {38817#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; {38817#false} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {38817#false} assume 0 == ~c_dr_pc~0; {38817#false} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {38817#false} assume !false; {38817#false} is VALID [2022-02-20 19:58:36,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {38817#false} assume !(1 == ~q_free~0); {38817#false} is VALID [2022-02-20 19:58:36,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {38817#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; {38817#false} is VALID [2022-02-20 19:58:36,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {38817#false} assume !(~p_last_write~0 == ~c_last_read~0); {38817#false} is VALID [2022-02-20 19:58:36,916 INFO L272 TraceCheckUtils]: 63: Hoare triple {38817#false} call error1(); {38817#false} is VALID [2022-02-20 19:58:36,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {38817#false} assume !false; {38817#false} is VALID [2022-02-20 19:58:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:36,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:36,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871374188] [2022-02-20 19:58:36,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871374188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:36,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:36,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:36,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962621589] [2022-02-20 19:58:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:36,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:36,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:36,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:36,957 INFO L87 Difference]: Start difference. First operand 1550 states and 2089 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,611 INFO L93 Difference]: Finished difference Result 3889 states and 5050 transitions. [2022-02-20 19:58:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2022-02-20 19:58:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2022-02-20 19:58:39,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1012 transitions. [2022-02-20 19:58:40,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1012 edges. 1012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:40,632 INFO L225 Difference]: With dead ends: 3889 [2022-02-20 19:58:40,633 INFO L226 Difference]: Without dead ends: 2733 [2022-02-20 19:58:40,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:40,635 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 2130 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2163 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:40,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2163 Valid, 1433 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-02-20 19:58:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2613. [2022-02-20 19:58:40,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:40,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2733 states. Second operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:40,776 INFO L74 IsIncluded]: Start isIncluded. First operand 2733 states. Second operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:40,779 INFO L87 Difference]: Start difference. First operand 2733 states. Second operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,013 INFO L93 Difference]: Finished difference Result 2733 states and 3524 transitions. [2022-02-20 19:58:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3524 transitions. [2022-02-20 19:58:41,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2733 states. [2022-02-20 19:58:41,028 INFO L87 Difference]: Start difference. First operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2733 states. [2022-02-20 19:58:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,245 INFO L93 Difference]: Finished difference Result 2733 states and 3524 transitions. [2022-02-20 19:58:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3524 transitions. [2022-02-20 19:58:41,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:41,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2096 states have (on average 1.3148854961832062) internal successors, (2756), 2132 states have internal predecessors, (2756), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3391 transitions. [2022-02-20 19:58:41,603 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3391 transitions. Word has length 65 [2022-02-20 19:58:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:41,604 INFO L470 AbstractCegarLoop]: Abstraction has 2613 states and 3391 transitions. [2022-02-20 19:58:41,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3391 transitions. [2022-02-20 19:58:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:41,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:41,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:41,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:41,608 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 176493782, now seen corresponding path program 1 times [2022-02-20 19:58:41,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:41,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580698396] [2022-02-20 19:58:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {53114#(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); {53074#true} is VALID [2022-02-20 19:58:41,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1913#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {53115#(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); {53074#true} is VALID [2022-02-20 19:58:41,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume !(0 == ~q_write_ev~0); {53074#true} is VALID [2022-02-20 19:58:41,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1915#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {53074#true} havoc ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume !(1 == ~p_dw_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} ~__retres1~0 := 0; {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {53074#true} #res := ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53074#true} {53074#true} #1909#return; {53074#true} is VALID [2022-02-20 19:58:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {53074#true} havoc ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume !(1 == ~c_dr_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} ~__retres1~1 := 0; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {53074#true} #res := ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53074#true} {53074#true} #1911#return; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {53116#(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; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L272 TraceCheckUtils]: 1: Hoare triple {53074#true} call #t~ret8 := is_do_write_p_triggered(); {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} havoc ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {53074#true} assume !(1 == ~p_dw_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {53074#true} ~__retres1~0 := 0; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {53074#true} #res := ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53074#true} {53074#true} #1909#return; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {53074#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {53074#true} assume !(0 != ~tmp~1); {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L272 TraceCheckUtils]: 10: Hoare triple {53074#true} call #t~ret9 := is_do_read_c_triggered(); {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {53074#true} havoc ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {53074#true} assume !(1 == ~c_dr_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {53074#true} ~__retres1~1 := 0; {53074#true} is VALID [2022-02-20 19:58:41,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {53074#true} #res := ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53074#true} {53074#true} #1911#return; {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {53074#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {53074#true} assume !(0 != ~tmp___0~1); {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,680 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1917#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {53115#(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); {53074#true} is VALID [2022-02-20 19:58:41,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume !(1 == ~q_write_ev~0); {53074#true} is VALID [2022-02-20 19:58:41,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1919#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {53074#true} havoc ~__retres1~2; {53074#true} is VALID [2022-02-20 19:58:41,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53074#true} is VALID [2022-02-20 19:58:41,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} #res := ~__retres1~2; {53074#true} is VALID [2022-02-20 19:58:41,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,692 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1921#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {53074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {53074#true} is VALID [2022-02-20 19:58:41,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {53074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {53074#true} is VALID [2022-02-20 19:58:41,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {53074#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {53076#(= ~q_free~0 1)} call update_channels1(); {53114#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:41,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {53114#(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); {53074#true} is VALID [2022-02-20 19:58:41,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,694 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1913#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {53076#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {53076#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {53076#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {53076#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,696 INFO L272 TraceCheckUtils]: 12: Hoare triple {53076#(= ~q_free~0 1)} call fire_delta_events1(); {53115#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:41,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {53115#(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); {53074#true} is VALID [2022-02-20 19:58:41,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {53074#true} assume !(0 == ~q_write_ev~0); {53074#true} is VALID [2022-02-20 19:58:41,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,696 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1915#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,697 INFO L272 TraceCheckUtils]: 17: Hoare triple {53076#(= ~q_free~0 1)} call activate_threads1(); {53116#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {53116#(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; {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L272 TraceCheckUtils]: 19: Hoare triple {53074#true} call #t~ret8 := is_do_write_p_triggered(); {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {53074#true} havoc ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {53074#true} assume !(1 == ~p_dw_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {53074#true} ~__retres1~0 := 0; {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {53074#true} #res := ~__retres1~0; {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,697 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {53074#true} {53074#true} #1909#return; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {53074#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {53074#true} assume !(0 != ~tmp~1); {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L272 TraceCheckUtils]: 28: Hoare triple {53074#true} call #t~ret9 := is_do_read_c_triggered(); {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {53074#true} havoc ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {53074#true} assume !(1 == ~c_dr_pc~0); {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {53074#true} ~__retres1~1 := 0; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {53074#true} #res := ~__retres1~1; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {53074#true} {53074#true} #1911#return; {53074#true} is VALID [2022-02-20 19:58:41,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {53074#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53074#true} is VALID [2022-02-20 19:58:41,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {53074#true} assume !(0 != ~tmp___0~1); {53074#true} is VALID [2022-02-20 19:58:41,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,699 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1917#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,699 INFO L272 TraceCheckUtils]: 39: Hoare triple {53076#(= ~q_free~0 1)} call reset_delta_events1(); {53115#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:41,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {53115#(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); {53074#true} is VALID [2022-02-20 19:58:41,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {53074#true} assume !(1 == ~q_write_ev~0); {53074#true} is VALID [2022-02-20 19:58:41,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,700 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1919#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {53076#(= ~q_free~0 1)} assume !false; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {53076#(= ~q_free~0 1)} assume !false; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,701 INFO L272 TraceCheckUtils]: 47: Hoare triple {53076#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53074#true} is VALID [2022-02-20 19:58:41,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {53074#true} havoc ~__retres1~2; {53074#true} is VALID [2022-02-20 19:58:41,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {53074#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53074#true} is VALID [2022-02-20 19:58:41,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {53074#true} #res := ~__retres1~2; {53074#true} is VALID [2022-02-20 19:58:41,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {53074#true} assume true; {53074#true} is VALID [2022-02-20 19:58:41,702 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {53074#true} {53076#(= ~q_free~0 1)} #1921#return; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {53076#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {53076#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {53076#(= ~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; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {53076#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {53076#(= ~q_free~0 1)} assume !false; {53076#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:41,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {53076#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {53075#false} is VALID [2022-02-20 19:58:41,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {53075#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; {53075#false} is VALID [2022-02-20 19:58:41,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {53075#false} assume !(~p_last_write~0 == ~c_last_read~0); {53075#false} is VALID [2022-02-20 19:58:41,704 INFO L272 TraceCheckUtils]: 64: Hoare triple {53075#false} call error1(); {53075#false} is VALID [2022-02-20 19:58:41,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {53075#false} assume !false; {53075#false} is VALID [2022-02-20 19:58:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:41,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:41,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580698396] [2022-02-20 19:58:41,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580698396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:41,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:41,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:41,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744513629] [2022-02-20 19:58:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:41,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:41,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:41,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:41,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:41,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:41,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:41,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:41,744 INFO L87 Difference]: Start difference. First operand 2613 states and 3391 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:45,177 INFO L93 Difference]: Finished difference Result 5929 states and 7536 transitions. [2022-02-20 19:58:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:45,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1002 transitions. [2022-02-20 19:58:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1002 transitions. [2022-02-20 19:58:45,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1002 transitions. [2022-02-20 19:58:45,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1002 edges. 1002 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:46,446 INFO L225 Difference]: With dead ends: 5929 [2022-02-20 19:58:46,447 INFO L226 Difference]: Without dead ends: 3715 [2022-02-20 19:58:46,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:46,470 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 828 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:46,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [837 Valid, 2086 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:58:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2022-02-20 19:58:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3447. [2022-02-20 19:58:46,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:46,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3715 states. Second operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:46,759 INFO L74 IsIncluded]: Start isIncluded. First operand 3715 states. Second operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:46,762 INFO L87 Difference]: Start difference. First operand 3715 states. Second operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,199 INFO L93 Difference]: Finished difference Result 3715 states and 4704 transitions. [2022-02-20 19:58:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 4704 transitions. [2022-02-20 19:58:47,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:47,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:47,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3715 states. [2022-02-20 19:58:47,214 INFO L87 Difference]: Start difference. First operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3715 states. [2022-02-20 19:58:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,635 INFO L93 Difference]: Finished difference Result 3715 states and 4704 transitions. [2022-02-20 19:58:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 4704 transitions. [2022-02-20 19:58:47,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:47,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:47,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:47,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2744 states have (on average 1.2940962099125364) internal successors, (3551), 2785 states have internal predecessors, (3551), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4392 transitions. [2022-02-20 19:58:48,182 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4392 transitions. Word has length 66 [2022-02-20 19:58:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,182 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4392 transitions. [2022-02-20 19:58:48,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4392 transitions. [2022-02-20 19:58:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:48,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:48,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:48,184 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 138145877, now seen corresponding path program 1 times [2022-02-20 19:58:48,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765008908] [2022-02-20 19:58:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {73183#(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); {73143#true} is VALID [2022-02-20 19:58:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1913#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {73184#(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); {73143#true} is VALID [2022-02-20 19:58:48,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume !(0 == ~q_write_ev~0); {73143#true} is VALID [2022-02-20 19:58:48,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1915#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {73143#true} havoc ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume !(1 == ~p_dw_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} ~__retres1~0 := 0; {73143#true} is VALID [2022-02-20 19:58:48,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {73143#true} #res := ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,233 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {73143#true} {73143#true} #1909#return; {73143#true} is VALID [2022-02-20 19:58:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {73143#true} havoc ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume !(1 == ~c_dr_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} ~__retres1~1 := 0; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {73143#true} #res := ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {73143#true} {73143#true} #1911#return; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {73185#(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; {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L272 TraceCheckUtils]: 1: Hoare triple {73143#true} call #t~ret8 := is_do_write_p_triggered(); {73143#true} is VALID [2022-02-20 19:58:48,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} havoc ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {73143#true} assume !(1 == ~p_dw_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {73143#true} ~__retres1~0 := 0; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {73143#true} #res := ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73143#true} {73143#true} #1909#return; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {73143#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {73143#true} assume !(0 != ~tmp~1); {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L272 TraceCheckUtils]: 10: Hoare triple {73143#true} call #t~ret9 := is_do_read_c_triggered(); {73143#true} is VALID [2022-02-20 19:58:48,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {73143#true} havoc ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {73143#true} assume !(1 == ~c_dr_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {73143#true} ~__retres1~1 := 0; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {73143#true} #res := ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73143#true} {73143#true} #1911#return; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {73143#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {73143#true} assume !(0 != ~tmp___0~1); {73143#true} is VALID [2022-02-20 19:58:48,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,238 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1917#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {73184#(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); {73143#true} is VALID [2022-02-20 19:58:48,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume !(1 == ~q_write_ev~0); {73143#true} is VALID [2022-02-20 19:58:48,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1919#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {73143#true} havoc ~__retres1~2; {73143#true} is VALID [2022-02-20 19:58:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {73143#true} is VALID [2022-02-20 19:58:48,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} #res := ~__retres1~2; {73143#true} is VALID [2022-02-20 19:58:48,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,244 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1921#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {73143#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {73143#true} is VALID [2022-02-20 19:58:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {73143#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {73143#true} is VALID [2022-02-20 19:58:48,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {73143#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {73145#(= ~p_dw_pc~0 0)} call update_channels1(); {73183#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:48,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {73183#(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); {73143#true} is VALID [2022-02-20 19:58:48,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1913#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,247 INFO L272 TraceCheckUtils]: 12: Hoare triple {73145#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {73184#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {73184#(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); {73143#true} is VALID [2022-02-20 19:58:48,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {73143#true} assume !(0 == ~q_write_ev~0); {73143#true} is VALID [2022-02-20 19:58:48,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,248 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1915#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {73145#(= ~p_dw_pc~0 0)} call activate_threads1(); {73185#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {73185#(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; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L272 TraceCheckUtils]: 19: Hoare triple {73143#true} call #t~ret8 := is_do_write_p_triggered(); {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {73143#true} havoc ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {73143#true} assume !(1 == ~p_dw_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {73143#true} ~__retres1~0 := 0; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {73143#true} #res := ~__retres1~0; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {73143#true} {73143#true} #1909#return; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {73143#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {73143#true} is VALID [2022-02-20 19:58:48,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {73143#true} assume !(0 != ~tmp~1); {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L272 TraceCheckUtils]: 28: Hoare triple {73143#true} call #t~ret9 := is_do_read_c_triggered(); {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {73143#true} havoc ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {73143#true} assume !(1 == ~c_dr_pc~0); {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {73143#true} ~__retres1~1 := 0; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {73143#true} #res := ~__retres1~1; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {73143#true} {73143#true} #1911#return; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {73143#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {73143#true} assume !(0 != ~tmp___0~1); {73143#true} is VALID [2022-02-20 19:58:48,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,251 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1917#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,251 INFO L272 TraceCheckUtils]: 39: Hoare triple {73145#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {73184#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:48,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {73184#(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); {73143#true} is VALID [2022-02-20 19:58:48,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {73143#true} assume !(1 == ~q_write_ev~0); {73143#true} is VALID [2022-02-20 19:58:48,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,252 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1919#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume !false; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {73145#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume !false; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,253 INFO L272 TraceCheckUtils]: 47: Hoare triple {73145#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {73143#true} is VALID [2022-02-20 19:58:48,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {73143#true} havoc ~__retres1~2; {73143#true} is VALID [2022-02-20 19:58:48,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {73143#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {73143#true} is VALID [2022-02-20 19:58:48,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {73143#true} #res := ~__retres1~2; {73143#true} is VALID [2022-02-20 19:58:48,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {73143#true} assume true; {73143#true} is VALID [2022-02-20 19:58:48,253 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {73143#true} {73145#(= ~p_dw_pc~0 0)} #1921#return; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {73145#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {73145#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {73144#false} assume 1 == ~p_dw_pc~0; {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {73144#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {73144#false} assume !false; {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {73144#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {73144#false} assume { :end_inline_do_write_p } true; {73144#false} is VALID [2022-02-20 19:58:48,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {73144#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; {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {73144#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; {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {73144#false} assume 0 == ~c_dr_pc~0; {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {73144#false} assume !false; {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {73144#false} assume !(1 == ~q_free~0); {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {73144#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; {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {73144#false} assume !(~p_last_write~0 == ~c_last_read~0); {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L272 TraceCheckUtils]: 70: Hoare triple {73144#false} call error1(); {73144#false} is VALID [2022-02-20 19:58:48,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {73144#false} assume !false; {73144#false} is VALID [2022-02-20 19:58:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:48,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:48,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765008908] [2022-02-20 19:58:48,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765008908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:48,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:48,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:48,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518475079] [2022-02-20 19:58:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:48,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:48,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:48,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:48,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:48,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:48,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:48,315 INFO L87 Difference]: Start difference. First operand 3447 states and 4392 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,664 INFO L93 Difference]: Finished difference Result 7319 states and 9166 transitions. [2022-02-20 19:58:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 999 transitions. [2022-02-20 19:58:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 999 transitions. [2022-02-20 19:58:52,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 999 transitions. [2022-02-20 19:58:53,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 999 edges. 999 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:54,141 INFO L225 Difference]: With dead ends: 7319 [2022-02-20 19:58:54,141 INFO L226 Difference]: Without dead ends: 4269 [2022-02-20 19:58:54,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:54,145 INFO L933 BasicCegarLoop]: 750 mSDtfsCounter, 1737 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:54,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 1484 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2022-02-20 19:58:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 4001. [2022-02-20 19:58:54,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:54,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4269 states. Second operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:54,366 INFO L74 IsIncluded]: Start isIncluded. First operand 4269 states. Second operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:54,370 INFO L87 Difference]: Start difference. First operand 4269 states. Second operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,933 INFO L93 Difference]: Finished difference Result 4269 states and 5370 transitions. [2022-02-20 19:58:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 5370 transitions. [2022-02-20 19:58:54,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:54,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:54,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4269 states. [2022-02-20 19:58:54,948 INFO L87 Difference]: Start difference. First operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4269 states. [2022-02-20 19:58:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,550 INFO L93 Difference]: Finished difference Result 4269 states and 5370 transitions. [2022-02-20 19:58:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 5370 transitions. [2022-02-20 19:58:55,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:55,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3184 states have (on average 1.2848618090452262) internal successors, (4091), 3229 states have internal predecessors, (4091), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 5061 transitions. [2022-02-20 19:58:56,301 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 5061 transitions. Word has length 72 [2022-02-20 19:58:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,301 INFO L470 AbstractCegarLoop]: Abstraction has 4001 states and 5061 transitions. [2022-02-20 19:58:56,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 5061 transitions. [2022-02-20 19:58:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:56,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,303 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:56,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:56,303 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -529402658, now seen corresponding path program 1 times [2022-02-20 19:58:56,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425534617] [2022-02-20 19:58:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {96983#(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); {96942#true} is VALID [2022-02-20 19:58:56,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96942#true} {96942#true} #1913#return; {96942#true} is VALID [2022-02-20 19:58:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {96984#(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); {96942#true} is VALID [2022-02-20 19:58:56,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume !(0 == ~q_write_ev~0); {96942#true} is VALID [2022-02-20 19:58:56,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96942#true} {96942#true} #1915#return; {96942#true} is VALID [2022-02-20 19:58:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {96942#true} havoc ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume !(1 == ~p_dw_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} ~__retres1~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {96942#true} #res := ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96942#true} {96942#true} #1909#return; {96942#true} is VALID [2022-02-20 19:58:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {96942#true} havoc ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume !(1 == ~c_dr_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} ~__retres1~1 := 0; {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {96942#true} #res := ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96942#true} {96942#true} #1911#return; {96942#true} is VALID [2022-02-20 19:58:56,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {96985#(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; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L272 TraceCheckUtils]: 1: Hoare triple {96942#true} call #t~ret8 := is_do_write_p_triggered(); {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} havoc ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {96942#true} assume !(1 == ~p_dw_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {96942#true} ~__retres1~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {96942#true} #res := ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96942#true} {96942#true} #1909#return; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {96942#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96942#true} is VALID [2022-02-20 19:58:56,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {96942#true} assume !(0 != ~tmp~1); {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L272 TraceCheckUtils]: 10: Hoare triple {96942#true} call #t~ret9 := is_do_read_c_triggered(); {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {96942#true} havoc ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {96942#true} assume !(1 == ~c_dr_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {96942#true} ~__retres1~1 := 0; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {96942#true} #res := ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96942#true} {96942#true} #1911#return; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {96942#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {96942#true} assume !(0 != ~tmp___0~1); {96942#true} is VALID [2022-02-20 19:58:56,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,391 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {96942#true} {96942#true} #1917#return; {96942#true} is VALID [2022-02-20 19:58:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {96984#(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); {96942#true} is VALID [2022-02-20 19:58:56,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume !(1 == ~q_write_ev~0); {96942#true} is VALID [2022-02-20 19:58:56,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96942#true} {96942#true} #1919#return; {96942#true} is VALID [2022-02-20 19:58:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {96942#true} havoc ~__retres1~2; {96942#true} is VALID [2022-02-20 19:58:56,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96942#true} is VALID [2022-02-20 19:58:56,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} #res := ~__retres1~2; {96942#true} is VALID [2022-02-20 19:58:56,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,399 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96942#true} {96942#true} #1921#return; {96942#true} is VALID [2022-02-20 19:58:56,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {96942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {96942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {96942#true} is VALID [2022-02-20 19:58:56,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {96942#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {96942#true} is VALID [2022-02-20 19:58:56,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {96942#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; {96942#true} is VALID [2022-02-20 19:58:56,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {96942#true} call update_channels1(); {96983#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:56,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {96983#(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); {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96942#true} {96942#true} #1913#return; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {96942#true} assume { :begin_inline_init_threads1 } true; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {96942#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {96942#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {96942#true} assume { :end_inline_init_threads1 } true; {96942#true} is VALID [2022-02-20 19:58:56,401 INFO L272 TraceCheckUtils]: 12: Hoare triple {96942#true} call fire_delta_events1(); {96984#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:56,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {96984#(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); {96942#true} is VALID [2022-02-20 19:58:56,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {96942#true} assume !(0 == ~q_write_ev~0); {96942#true} is VALID [2022-02-20 19:58:56,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,402 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96942#true} {96942#true} #1915#return; {96942#true} is VALID [2022-02-20 19:58:56,402 INFO L272 TraceCheckUtils]: 17: Hoare triple {96942#true} call activate_threads1(); {96985#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:56,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {96985#(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; {96942#true} is VALID [2022-02-20 19:58:56,402 INFO L272 TraceCheckUtils]: 19: Hoare triple {96942#true} call #t~ret8 := is_do_write_p_triggered(); {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {96942#true} havoc ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {96942#true} assume !(1 == ~p_dw_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {96942#true} ~__retres1~0 := 0; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {96942#true} #res := ~__retres1~0; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {96942#true} {96942#true} #1909#return; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {96942#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {96942#true} assume !(0 != ~tmp~1); {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L272 TraceCheckUtils]: 28: Hoare triple {96942#true} call #t~ret9 := is_do_read_c_triggered(); {96942#true} is VALID [2022-02-20 19:58:56,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {96942#true} havoc ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {96942#true} assume !(1 == ~c_dr_pc~0); {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {96942#true} ~__retres1~1 := 0; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {96942#true} #res := ~__retres1~1; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {96942#true} {96942#true} #1911#return; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {96942#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {96942#true} assume !(0 != ~tmp___0~1); {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,404 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {96942#true} {96942#true} #1917#return; {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L272 TraceCheckUtils]: 39: Hoare triple {96942#true} call reset_delta_events1(); {96984#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:56,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {96984#(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); {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {96942#true} assume !(1 == ~q_write_ev~0); {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {96942#true} {96942#true} #1919#return; {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {96942#true} assume !false; {96942#true} is VALID [2022-02-20 19:58:56,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {96942#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; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {96942#true} assume !false; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L272 TraceCheckUtils]: 47: Hoare triple {96942#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {96942#true} havoc ~__retres1~2; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {96942#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {96942#true} #res := ~__retres1~2; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {96942#true} assume true; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {96942#true} {96942#true} #1921#return; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {96942#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; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {96942#true} assume 0 != eval1_~tmp___1~0#1; {96942#true} is VALID [2022-02-20 19:58:56,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {96942#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; {96942#true} is VALID [2022-02-20 19:58:56,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {96942#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; {96942#true} is VALID [2022-02-20 19:58:56,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {96942#true} assume 0 == ~p_dw_pc~0; {96942#true} is VALID [2022-02-20 19:58:56,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {96942#true} assume !false; {96942#true} is VALID [2022-02-20 19:58:56,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {96942#true} assume !(0 == ~q_free~0); {96942#true} is VALID [2022-02-20 19:58:56,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {96942#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; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {96981#(= ~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; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {96981#(= ~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; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {96981#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {96981#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:56,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {96981#(= ~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; {96982#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:56,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {96982#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {96943#false} is VALID [2022-02-20 19:58:56,411 INFO L272 TraceCheckUtils]: 71: Hoare triple {96943#false} call error1(); {96943#false} is VALID [2022-02-20 19:58:56,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {96943#false} assume !false; {96943#false} is VALID [2022-02-20 19:58:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:56,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:56,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425534617] [2022-02-20 19:58:56,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425534617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:56,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:56,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:56,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805452606] [2022-02-20 19:58:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:56,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:56,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:56,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:56,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:56,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:56,456 INFO L87 Difference]: Start difference. First operand 4001 states and 5061 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:59,893 INFO L93 Difference]: Finished difference Result 5087 states and 6356 transitions. [2022-02-20 19:58:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:59,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 882 transitions. [2022-02-20 19:58:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 882 transitions. [2022-02-20 19:58:59,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 882 transitions. [2022-02-20 19:59:00,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:01,543 INFO L225 Difference]: With dead ends: 5087 [2022-02-20 19:59:01,543 INFO L226 Difference]: Without dead ends: 5084 [2022-02-20 19:59:01,544 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:59:01,546 INFO L933 BasicCegarLoop]: 745 mSDtfsCounter, 2436 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:01,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2446 Valid, 1462 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2022-02-20 19:59:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 4463. [2022-02-20 19:59:01,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:01,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5084 states. Second operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:01,818 INFO L74 IsIncluded]: Start isIncluded. First operand 5084 states. Second operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:01,822 INFO L87 Difference]: Start difference. First operand 5084 states. Second operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,602 INFO L93 Difference]: Finished difference Result 5084 states and 6336 transitions. [2022-02-20 19:59:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6336 transitions. [2022-02-20 19:59:02,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5084 states. [2022-02-20 19:59:02,620 INFO L87 Difference]: Start difference. First operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5084 states. [2022-02-20 19:59:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:03,411 INFO L93 Difference]: Finished difference Result 5084 states and 6336 transitions. [2022-02-20 19:59:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6336 transitions. [2022-02-20 19:59:03,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:03,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:03,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:03,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 3539 states have (on average 1.2735235942356598) internal successors, (4507), 3587 states have internal predecessors, (4507), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 5604 transitions. [2022-02-20 19:59:04,392 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 5604 transitions. Word has length 73 [2022-02-20 19:59:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:04,392 INFO L470 AbstractCegarLoop]: Abstraction has 4463 states and 5604 transitions. [2022-02-20 19:59:04,392 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:59:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 5604 transitions. [2022-02-20 19:59:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:59:04,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:04,393 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:59:04,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:59:04,393 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash 766925247, now seen corresponding path program 1 times [2022-02-20 19:59:04,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:04,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495365194] [2022-02-20 19:59:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {119994#(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); {119952#true} is VALID [2022-02-20 19:59:04,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1913#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {119995#(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); {119952#true} is VALID [2022-02-20 19:59:04,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume !(0 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:04,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1915#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} havoc ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume !(1 == ~p_dw_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} ~__retres1~0 := 0; {119952#true} is VALID [2022-02-20 19:59:04,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {119952#true} #res := ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,486 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119952#true} {119952#true} #1909#return; {119952#true} is VALID [2022-02-20 19:59:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} havoc ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume !(1 == ~c_dr_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} ~__retres1~1 := 0; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {119952#true} #res := ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119952#true} {119952#true} #1911#return; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {119996#(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; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L272 TraceCheckUtils]: 1: Hoare triple {119952#true} call #t~ret8 := is_do_write_p_triggered(); {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} havoc ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {119952#true} assume !(1 == ~p_dw_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {119952#true} ~__retres1~0 := 0; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {119952#true} #res := ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119952#true} {119952#true} #1909#return; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {119952#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {119952#true} assume !(0 != ~tmp~1); {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L272 TraceCheckUtils]: 10: Hoare triple {119952#true} call #t~ret9 := is_do_read_c_triggered(); {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {119952#true} havoc ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {119952#true} assume !(1 == ~c_dr_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {119952#true} ~__retres1~1 := 0; {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {119952#true} #res := ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119952#true} {119952#true} #1911#return; {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {119952#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {119952#true} assume !(0 != ~tmp___0~1); {119952#true} is VALID [2022-02-20 19:59:04,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,493 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1917#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {119995#(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); {119952#true} is VALID [2022-02-20 19:59:04,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume !(1 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:04,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1919#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} havoc ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:04,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119952#true} is VALID [2022-02-20 19:59:04,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} #res := ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:04,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,501 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1921#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119952#true} is VALID [2022-02-20 19:59:04,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119952#true} is VALID [2022-02-20 19:59:04,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119994#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:04,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {119994#(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); {119952#true} is VALID [2022-02-20 19:59:04,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,503 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1913#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,505 INFO L272 TraceCheckUtils]: 12: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119995#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:04,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {119995#(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); {119952#true} is VALID [2022-02-20 19:59:04,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {119952#true} assume !(0 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:04,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,506 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1915#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,506 INFO L272 TraceCheckUtils]: 17: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119996#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:04,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {119996#(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; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {119952#true} call #t~ret8 := is_do_write_p_triggered(); {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {119952#true} havoc ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {119952#true} assume !(1 == ~p_dw_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {119952#true} ~__retres1~0 := 0; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {119952#true} #res := ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119952#true} {119952#true} #1909#return; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {119952#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {119952#true} assume !(0 != ~tmp~1); {119952#true} is VALID [2022-02-20 19:59:04,507 INFO L272 TraceCheckUtils]: 28: Hoare triple {119952#true} call #t~ret9 := is_do_read_c_triggered(); {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {119952#true} havoc ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {119952#true} assume !(1 == ~c_dr_pc~0); {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {119952#true} ~__retres1~1 := 0; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {119952#true} #res := ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119952#true} {119952#true} #1911#return; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {119952#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {119952#true} assume !(0 != ~tmp___0~1); {119952#true} is VALID [2022-02-20 19:59:04,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,509 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1917#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,509 INFO L272 TraceCheckUtils]: 39: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119995#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:04,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {119995#(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); {119952#true} is VALID [2022-02-20 19:59:04,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {119952#true} assume !(1 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:04,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,510 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1919#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,511 INFO L272 TraceCheckUtils]: 47: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119952#true} is VALID [2022-02-20 19:59:04,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {119952#true} havoc ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:04,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {119952#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119952#true} is VALID [2022-02-20 19:59:04,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {119952#true} #res := ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:04,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:04,512 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119952#true} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1921#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:04,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {119954#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,517 INFO L290 TraceCheckUtils]: 67: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:04,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {119992#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:04,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:04,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {119993#(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); {119953#false} is VALID [2022-02-20 19:59:04,519 INFO L272 TraceCheckUtils]: 72: Hoare triple {119953#false} call error1(); {119953#false} is VALID [2022-02-20 19:59:04,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {119953#false} assume !false; {119953#false} is VALID [2022-02-20 19:59:04,519 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:59:04,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:04,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495365194] [2022-02-20 19:59:04,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495365194] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:59:04,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55466921] [2022-02-20 19:59:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:04,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:59:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:04,536 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:59:04,539 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:59:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:59:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:05,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119952#true} is VALID [2022-02-20 19:59:05,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119952#true} is VALID [2022-02-20 19:59:05,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,280 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1913#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1915#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,284 INFO L272 TraceCheckUtils]: 19: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,286 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1909#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,288 INFO L272 TraceCheckUtils]: 28: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,290 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1911#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,291 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1917#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,291 INFO L272 TraceCheckUtils]: 39: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,293 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1919#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,294 INFO L272 TraceCheckUtils]: 47: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,296 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1921#return; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {119954#(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; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119954#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:05,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {119954#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {119992#(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; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119992#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {119992#(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; {120219#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {120219#(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; {120219#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:05,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {120219#(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); {119953#false} is VALID [2022-02-20 19:59:05,303 INFO L272 TraceCheckUtils]: 72: Hoare triple {119953#false} call error1(); {119953#false} is VALID [2022-02-20 19:59:05,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {119953#false} assume !false; {119953#false} is VALID [2022-02-20 19:59:05,303 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:59:05,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:59:05,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {119953#false} assume !false; {119953#false} is VALID [2022-02-20 19:59:05,626 INFO L272 TraceCheckUtils]: 72: Hoare triple {119953#false} call error1(); {119953#false} is VALID [2022-02-20 19:59:05,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {119993#(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); {119953#false} is VALID [2022-02-20 19:59:05,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {120244#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,628 INFO L290 TraceCheckUtils]: 67: Hoare triple {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {120244#(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; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,629 INFO L290 TraceCheckUtils]: 64: Hoare triple {120244#(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; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {120244#(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; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {120244#(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; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,631 INFO L290 TraceCheckUtils]: 60: Hoare triple {119993#(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; {120244#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:05,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,631 INFO L290 TraceCheckUtils]: 58: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,632 INFO L290 TraceCheckUtils]: 57: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,632 INFO L290 TraceCheckUtils]: 55: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,634 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119952#true} {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1921#return; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {119952#true} #res := ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:05,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {119952#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119952#true} is VALID [2022-02-20 19:59:05,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {119952#true} havoc ~__retres1~2; {119952#true} is VALID [2022-02-20 19:59:05,634 INFO L272 TraceCheckUtils]: 47: Hoare triple {119993#(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(); {119952#true} is VALID [2022-02-20 19:59:05,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,636 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119952#true} {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1919#return; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {119952#true} assume !(1 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:05,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {119952#true} assume !(1 == ~q_read_ev~0); {119952#true} is VALID [2022-02-20 19:59:05,636 INFO L272 TraceCheckUtils]: 39: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119952#true} {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1917#return; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {119952#true} assume !(0 != ~tmp___0~1); {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {119952#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119952#true} {119952#true} #1911#return; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {119952#true} #res := ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {119952#true} ~__retres1~1 := 0; {119952#true} is VALID [2022-02-20 19:59:05,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {119952#true} assume !(1 == ~c_dr_pc~0); {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {119952#true} havoc ~__retres1~1; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L272 TraceCheckUtils]: 28: Hoare triple {119952#true} call #t~ret9 := is_do_read_c_triggered(); {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {119952#true} assume !(0 != ~tmp~1); {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {119952#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119952#true} {119952#true} #1909#return; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {119952#true} #res := ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {119952#true} ~__retres1~0 := 0; {119952#true} is VALID [2022-02-20 19:59:05,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {119952#true} assume !(1 == ~p_dw_pc~0); {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {119952#true} havoc ~__retres1~0; {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L272 TraceCheckUtils]: 19: Hoare triple {119952#true} call #t~ret8 := is_do_write_p_triggered(); {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {119952#true} havoc ~tmp~1;havoc ~tmp___0~1; {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L272 TraceCheckUtils]: 17: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119952#true} {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1915#return; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {119952#true} assume !(0 == ~q_write_ev~0); {119952#true} is VALID [2022-02-20 19:59:05,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {119952#true} assume !(0 == ~q_read_ev~0); {119952#true} is VALID [2022-02-20 19:59:05,640 INFO L272 TraceCheckUtils]: 12: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {119952#true} is VALID [2022-02-20 19:59:05,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,641 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119952#true} {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1913#return; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {119952#true} assume true; {119952#true} is VALID [2022-02-20 19:59:05,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {119952#true} assume !(1 == ~q_req_up~0); {119952#true} is VALID [2022-02-20 19:59:05,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {119952#true} is VALID [2022-02-20 19:59:05,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {119993#(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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {119952#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119993#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:05,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {119952#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119952#true} is VALID [2022-02-20 19:59:05,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {119952#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119952#true} is VALID [2022-02-20 19:59:05,643 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:59:05,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55466921] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:59:05,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:59:05,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:59:05,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880079271] [2022-02-20 19:59:05,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:59:05,644 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:59:05,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:05,645 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:59:05,747 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:59:05,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:05,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:05,748 INFO L87 Difference]: Start difference. First operand 4463 states and 5604 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)