./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:00,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:00,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:00,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:00,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:00,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:00,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:00,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:00,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:00,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:00,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:00,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:00,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:00,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:00,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:00,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:00,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:00,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:00,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:00,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:00,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:00,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:00,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:00,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:00,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:00,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:00,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:00,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:00,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:00,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:00,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:00,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:00,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:00,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:00,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:00,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:00,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:00,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:00,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:00,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:00,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:00,635 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:00,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:00,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:00,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:00,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:00,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:00,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:00,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:00,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:00,663 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:00,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:00,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:00,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:00,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:00,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:00,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:00,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:00,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:00,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:00,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:00,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:00,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:00,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:00,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:00,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:00,668 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:00,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:00,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:00,669 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 -> b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 [2022-02-20 19:58:00,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:00,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:00,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:00,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:00,853 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:00,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2022-02-20 19:58:00,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba26e00e5/b6f8e5540154428ca95af1228617512c/FLAG198b04ab9 [2022-02-20 19:58:01,306 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:01,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2022-02-20 19:58:01,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba26e00e5/b6f8e5540154428ca95af1228617512c/FLAG198b04ab9 [2022-02-20 19:58:01,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba26e00e5/b6f8e5540154428ca95af1228617512c [2022-02-20 19:58:01,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:01,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:01,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:01,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:01,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:01,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:01" (1/1) ... [2022-02-20 19:58:01,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a552b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:01, skipping insertion in model container [2022-02-20 19:58:01,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:01" (1/1) ... [2022-02-20 19:58:01,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:01,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:01,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2022-02-20 19:58:01,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2022-02-20 19:58:01,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:01,997 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:02,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[914,927] [2022-02-20 19:58:02,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2022-02-20 19:58:02,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:02,106 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:02,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:02 WrapperNode [2022-02-20 19:58:02,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:02,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:02,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:02,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:02,113 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:02" (1/1) ... [2022-02-20 19:58:02,137 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:02" (1/1) ... [2022-02-20 19:58:02,200 INFO L137 Inliner]: procedures = 75, calls = 90, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 982 [2022-02-20 19:58:02,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:02,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:02,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:02,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:02,210 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:02" (1/1) ... [2022-02-20 19:58:02,211 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:02" (1/1) ... [2022-02-20 19:58:02,214 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:02" (1/1) ... [2022-02-20 19:58:02,215 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:02" (1/1) ... [2022-02-20 19:58:02,227 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:02" (1/1) ... [2022-02-20 19:58:02,251 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:02" (1/1) ... [2022-02-20 19:58:02,262 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:02" (1/1) ... [2022-02-20 19:58:02,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:02,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:02,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:02,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:02,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:02" (1/1) ... [2022-02-20 19:58:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:02,306 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:02,312 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:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:02,335 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:02,335 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:02,336 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:02,340 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:02,450 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:02,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:03,186 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:03,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:03,208 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 19:58:03,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:03 BoogieIcfgContainer [2022-02-20 19:58:03,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:03,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:03,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:03,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:03,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:01" (1/3) ... [2022-02-20 19:58:03,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79429a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:03, skipping insertion in model container [2022-02-20 19:58:03,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:02" (2/3) ... [2022-02-20 19:58:03,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79429a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:03, skipping insertion in model container [2022-02-20 19:58:03,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:03" (3/3) ... [2022-02-20 19:58:03,216 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2022-02-20 19:58:03,220 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:03,220 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:03,264 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:03,270 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:03,270 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 458 states, 402 states have (on average 1.63681592039801) internal successors, (658), 408 states have internal predecessors, (658), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 19:58:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:03,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:03,309 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:03,309 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -978370307, now seen corresponding path program 1 times [2022-02-20 19:58:03,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:03,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084572333] [2022-02-20 19:58:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#(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); {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {463#(= ~q_read_ev~0 2)} #1772#return; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#(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; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#(= |old(~q_read_ev~0)| 0)} assume true; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {504#(= |old(~q_read_ev~0)| 0)} {463#(= ~q_read_ev~0 2)} #1774#return; {462#false} is VALID [2022-02-20 19:58:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} havoc ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume !(1 == ~p_dw_pc~0); {461#true} is VALID [2022-02-20 19:58:03,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} ~__retres1~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#true} #res := ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,686 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {461#true} {461#true} #1768#return; {461#true} is VALID [2022-02-20 19:58:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} havoc ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume 1 == ~c_dr_pc~0; {461#true} is VALID [2022-02-20 19:58:03,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {461#true} is VALID [2022-02-20 19:58:03,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#true} #res := ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,699 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {461#true} {461#true} #1770#return; {461#true} is VALID [2022-02-20 19:58:03,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {505#(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; {461#true} is VALID [2022-02-20 19:58:03,700 INFO L272 TraceCheckUtils]: 1: Hoare triple {461#true} call #t~ret8 := is_do_write_p_triggered(); {461#true} is VALID [2022-02-20 19:58:03,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} havoc ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#true} assume !(1 == ~p_dw_pc~0); {461#true} is VALID [2022-02-20 19:58:03,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#true} ~__retres1~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#true} #res := ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,703 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {461#true} {461#true} #1768#return; {461#true} is VALID [2022-02-20 19:58:03,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {461#true} is VALID [2022-02-20 19:58:03,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {461#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {461#true} call #t~ret9 := is_do_read_c_triggered(); {461#true} is VALID [2022-02-20 19:58:03,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {461#true} havoc ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {461#true} assume 1 == ~c_dr_pc~0; {461#true} is VALID [2022-02-20 19:58:03,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {461#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {461#true} is VALID [2022-02-20 19:58:03,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#true} #res := ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,705 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {461#true} {461#true} #1770#return; {461#true} is VALID [2022-02-20 19:58:03,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {461#true} is VALID [2022-02-20 19:58:03,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,707 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {461#true} {462#false} #1776#return; {462#false} is VALID [2022-02-20 19:58:03,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#(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; {461#true} is VALID [2022-02-20 19:58:03,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume !(1 == ~q_write_ev~0); {461#true} is VALID [2022-02-20 19:58:03,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {461#true} {462#false} #1778#return; {462#false} is VALID [2022-02-20 19:58:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} havoc ~__retres1~2; {461#true} is VALID [2022-02-20 19:58:03,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {461#true} is VALID [2022-02-20 19:58:03,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} #res := ~__retres1~2; {461#true} is VALID [2022-02-20 19:58:03,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,735 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {461#true} {462#false} #1780#return; {462#false} is VALID [2022-02-20 19:58:03,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {461#true} is VALID [2022-02-20 19:58:03,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {463#(= ~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; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#(= ~q_read_ev~0 2)} call update_channels1(); {501#(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:03,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(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); {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,741 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {502#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {463#(= ~q_read_ev~0 2)} #1772#return; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {463#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:03,743 INFO L272 TraceCheckUtils]: 12: Hoare triple {463#(= ~q_read_ev~0 2)} call fire_delta_events1(); {503#(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:03,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {503#(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; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {504#(= |old(~q_read_ev~0)| 0)} assume true; {504#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:03,745 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {504#(= |old(~q_read_ev~0)| 0)} {463#(= ~q_read_ev~0 2)} #1774#return; {462#false} is VALID [2022-02-20 19:58:03,745 INFO L272 TraceCheckUtils]: 17: Hoare triple {462#false} call activate_threads1(); {505#(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:03,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(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; {461#true} is VALID [2022-02-20 19:58:03,745 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#true} call #t~ret8 := is_do_write_p_triggered(); {461#true} is VALID [2022-02-20 19:58:03,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#true} havoc ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#true} assume !(1 == ~p_dw_pc~0); {461#true} is VALID [2022-02-20 19:58:03,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#true} ~__retres1~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {461#true} #res := ~__retres1~0; {461#true} is VALID [2022-02-20 19:58:03,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,747 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {461#true} {461#true} #1768#return; {461#true} is VALID [2022-02-20 19:58:03,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {461#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {461#true} is VALID [2022-02-20 19:58:03,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {461#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,747 INFO L272 TraceCheckUtils]: 28: Hoare triple {461#true} call #t~ret9 := is_do_read_c_triggered(); {461#true} is VALID [2022-02-20 19:58:03,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#true} havoc ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#true} assume 1 == ~c_dr_pc~0; {461#true} is VALID [2022-02-20 19:58:03,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {461#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {461#true} is VALID [2022-02-20 19:58:03,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {461#true} #res := ~__retres1~1; {461#true} is VALID [2022-02-20 19:58:03,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,749 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {461#true} {461#true} #1770#return; {461#true} is VALID [2022-02-20 19:58:03,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {461#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {461#true} is VALID [2022-02-20 19:58:03,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {461#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {461#true} is VALID [2022-02-20 19:58:03,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,749 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {461#true} {462#false} #1776#return; {462#false} is VALID [2022-02-20 19:58:03,750 INFO L272 TraceCheckUtils]: 39: Hoare triple {462#false} call reset_delta_events1(); {503#(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:03,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {503#(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; {461#true} is VALID [2022-02-20 19:58:03,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {461#true} assume !(1 == ~q_write_ev~0); {461#true} is VALID [2022-02-20 19:58:03,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,750 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {461#true} {462#false} #1778#return; {462#false} is VALID [2022-02-20 19:58:03,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-02-20 19:58:03,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {462#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; {462#false} is VALID [2022-02-20 19:58:03,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-02-20 19:58:03,751 INFO L272 TraceCheckUtils]: 47: Hoare triple {462#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {461#true} is VALID [2022-02-20 19:58:03,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#true} havoc ~__retres1~2; {461#true} is VALID [2022-02-20 19:58:03,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {461#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {461#true} is VALID [2022-02-20 19:58:03,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {461#true} #res := ~__retres1~2; {461#true} is VALID [2022-02-20 19:58:03,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {461#true} assume true; {461#true} is VALID [2022-02-20 19:58:03,753 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {461#true} {462#false} #1780#return; {462#false} is VALID [2022-02-20 19:58:03,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {462#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; {462#false} is VALID [2022-02-20 19:58:03,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {462#false} assume 0 != eval1_~tmp___1~0#1; {462#false} is VALID [2022-02-20 19:58:03,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {462#false} assume !(0 == ~p_dw_st~0); {462#false} is VALID [2022-02-20 19:58:03,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {462#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; {462#false} is VALID [2022-02-20 19:58:03,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {462#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; {462#false} is VALID [2022-02-20 19:58:03,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {462#false} assume 0 == ~c_dr_pc~0; {462#false} is VALID [2022-02-20 19:58:03,755 INFO L290 TraceCheckUtils]: 59: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-02-20 19:58:03,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {462#false} assume !(1 == ~q_free~0); {462#false} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {462#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; {462#false} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {462#false} assume !(~p_last_write~0 == ~c_last_read~0); {462#false} is VALID [2022-02-20 19:58:03,760 INFO L272 TraceCheckUtils]: 63: Hoare triple {462#false} call error1(); {462#false} is VALID [2022-02-20 19:58:03,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-02-20 19:58:03,762 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:03,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:03,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084572333] [2022-02-20 19:58:03,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084572333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:03,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:03,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:03,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177954330] [2022-02-20 19:58:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:03,770 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:03,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:03,773 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:03,825 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:03,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:03,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:03,842 INFO L87 Difference]: Start difference. First operand has 458 states, 402 states have (on average 1.63681592039801) internal successors, (658), 408 states have internal predecessors, (658), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) 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:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:07,118 INFO L93 Difference]: Finished difference Result 1024 states and 1632 transitions. [2022-02-20 19:58:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:07,118 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:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:07,119 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:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1632 transitions. [2022-02-20 19:58:07,143 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:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1632 transitions. [2022-02-20 19:58:07,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1632 transitions. [2022-02-20 19:58:08,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1632 edges. 1632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:08,220 INFO L225 Difference]: With dead ends: 1024 [2022-02-20 19:58:08,220 INFO L226 Difference]: Without dead ends: 583 [2022-02-20 19:58:08,225 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:08,227 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 810 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:08,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 2629 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-02-20 19:58:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 544. [2022-02-20 19:58:08,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:08,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:08,277 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:08,278 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:08,334 INFO L93 Difference]: Finished difference Result 583 states and 872 transitions. [2022-02-20 19:58:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 872 transitions. [2022-02-20 19:58:08,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:08,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:08,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 583 states. [2022-02-20 19:58:08,346 INFO L87 Difference]: Start difference. First operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 583 states. [2022-02-20 19:58:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:08,394 INFO L93 Difference]: Finished difference Result 583 states and 872 transitions. [2022-02-20 19:58:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 872 transitions. [2022-02-20 19:58:08,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:08,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:08,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 476 states have internal predecessors, (715), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:58:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 818 transitions. [2022-02-20 19:58:08,455 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 818 transitions. Word has length 65 [2022-02-20 19:58:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:08,455 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 818 transitions. [2022-02-20 19:58:08,457 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:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 818 transitions. [2022-02-20 19:58:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:08,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:08,460 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:08,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:08,461 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 700518333, now seen corresponding path program 1 times [2022-02-20 19:58:08,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:08,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993489110] [2022-02-20 19:58:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {3813#(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); {3814#(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:08,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3814#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3814#(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:08,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3814#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3775#(= ~q_write_ev~0 ~q_read_ev~0)} #1772#return; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {3814#(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); {3815#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#(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; {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3775#(= ~q_write_ev~0 ~q_read_ev~0)} #1774#return; {3774#false} is VALID [2022-02-20 19:58:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#true} havoc ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume !(1 == ~p_dw_pc~0); {3773#true} is VALID [2022-02-20 19:58:08,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} ~__retres1~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#true} #res := ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,618 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3773#true} {3773#true} #1768#return; {3773#true} is VALID [2022-02-20 19:58:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#true} havoc ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume 1 == ~c_dr_pc~0; {3773#true} is VALID [2022-02-20 19:58:08,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3773#true} is VALID [2022-02-20 19:58:08,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#true} #res := ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,627 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3773#true} {3773#true} #1770#return; {3773#true} is VALID [2022-02-20 19:58:08,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {3817#(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; {3773#true} is VALID [2022-02-20 19:58:08,627 INFO L272 TraceCheckUtils]: 1: Hoare triple {3773#true} call #t~ret8 := is_do_write_p_triggered(); {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} havoc ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#true} assume !(1 == ~p_dw_pc~0); {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {3773#true} ~__retres1~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {3773#true} #res := ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,628 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3773#true} {3773#true} #1768#return; {3773#true} is VALID [2022-02-20 19:58:08,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3773#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3773#true} is VALID [2022-02-20 19:58:08,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {3773#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,629 INFO L272 TraceCheckUtils]: 10: Hoare triple {3773#true} call #t~ret9 := is_do_read_c_triggered(); {3773#true} is VALID [2022-02-20 19:58:08,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {3773#true} havoc ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#true} assume 1 == ~c_dr_pc~0; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {3773#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {3773#true} #res := ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3773#true} {3773#true} #1770#return; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {3773#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3773#true} is VALID [2022-02-20 19:58:08,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {3773#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,631 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3773#true} {3774#false} #1776#return; {3774#false} is VALID [2022-02-20 19:58:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {3814#(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); {3773#true} is VALID [2022-02-20 19:58:08,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume !(1 == ~q_write_ev~0); {3773#true} is VALID [2022-02-20 19:58:08,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3773#true} {3774#false} #1778#return; {3774#false} is VALID [2022-02-20 19:58:08,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#true} havoc ~__retres1~2; {3773#true} is VALID [2022-02-20 19:58:08,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3773#true} is VALID [2022-02-20 19:58:08,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} #res := ~__retres1~2; {3773#true} is VALID [2022-02-20 19:58:08,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,650 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3773#true} {3774#false} #1780#return; {3774#false} is VALID [2022-02-20 19:58:08,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {3773#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3773#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {3773#true} is VALID [2022-02-20 19:58:08,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {3773#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {3775#(= ~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; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3813#(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:08,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {3813#(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); {3814#(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:08,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {3814#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3814#(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:08,653 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3814#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3775#(= ~q_write_ev~0 ~q_read_ev~0)} #1772#return; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3775#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:08,655 INFO L272 TraceCheckUtils]: 12: Hoare triple {3775#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3814#(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:08,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {3814#(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); {3815#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {3815#(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; {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:08,657 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3816#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3775#(= ~q_write_ev~0 ~q_read_ev~0)} #1774#return; {3774#false} is VALID [2022-02-20 19:58:08,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {3774#false} call activate_threads1(); {3817#(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:08,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {3817#(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; {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {3773#true} call #t~ret8 := is_do_write_p_triggered(); {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {3773#true} havoc ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {3773#true} assume !(1 == ~p_dw_pc~0); {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {3773#true} ~__retres1~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {3773#true} #res := ~__retres1~0; {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,658 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3773#true} {3773#true} #1768#return; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {3773#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {3773#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L272 TraceCheckUtils]: 28: Hoare triple {3773#true} call #t~ret9 := is_do_read_c_triggered(); {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {3773#true} havoc ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {3773#true} assume 1 == ~c_dr_pc~0; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {3773#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3773#true} is VALID [2022-02-20 19:58:08,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {3773#true} #res := ~__retres1~1; {3773#true} is VALID [2022-02-20 19:58:08,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,663 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3773#true} {3773#true} #1770#return; {3773#true} is VALID [2022-02-20 19:58:08,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {3773#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3773#true} is VALID [2022-02-20 19:58:08,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {3773#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3773#true} is VALID [2022-02-20 19:58:08,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,664 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3773#true} {3774#false} #1776#return; {3774#false} is VALID [2022-02-20 19:58:08,664 INFO L272 TraceCheckUtils]: 39: Hoare triple {3774#false} call reset_delta_events1(); {3814#(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:08,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {3814#(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); {3773#true} is VALID [2022-02-20 19:58:08,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {3773#true} assume !(1 == ~q_write_ev~0); {3773#true} is VALID [2022-02-20 19:58:08,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,665 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3773#true} {3774#false} #1778#return; {3774#false} is VALID [2022-02-20 19:58:08,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {3774#false} assume !false; {3774#false} is VALID [2022-02-20 19:58:08,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {3774#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; {3774#false} is VALID [2022-02-20 19:58:08,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {3774#false} assume !false; {3774#false} is VALID [2022-02-20 19:58:08,667 INFO L272 TraceCheckUtils]: 47: Hoare triple {3774#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3773#true} is VALID [2022-02-20 19:58:08,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {3773#true} havoc ~__retres1~2; {3773#true} is VALID [2022-02-20 19:58:08,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {3773#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3773#true} is VALID [2022-02-20 19:58:08,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {3773#true} #res := ~__retres1~2; {3773#true} is VALID [2022-02-20 19:58:08,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {3773#true} assume true; {3773#true} is VALID [2022-02-20 19:58:08,667 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3773#true} {3774#false} #1780#return; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {3774#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; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {3774#false} assume 0 != eval1_~tmp___1~0#1; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {3774#false} assume !(0 == ~p_dw_st~0); {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {3774#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; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {3774#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; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {3774#false} assume 0 == ~c_dr_pc~0; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {3774#false} assume !false; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {3774#false} assume !(1 == ~q_free~0); {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {3774#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; {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {3774#false} assume !(~p_last_write~0 == ~c_last_read~0); {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L272 TraceCheckUtils]: 63: Hoare triple {3774#false} call error1(); {3774#false} is VALID [2022-02-20 19:58:08,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {3774#false} assume !false; {3774#false} is VALID [2022-02-20 19:58:08,669 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:08,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:08,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993489110] [2022-02-20 19:58:08,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993489110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:08,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:08,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:08,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347458145] [2022-02-20 19:58:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:08,671 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:08,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:08,671 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:08,704 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:08,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:08,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:08,706 INFO L87 Difference]: Start difference. First operand 544 states and 818 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:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,048 INFO L93 Difference]: Finished difference Result 891 states and 1295 transitions. [2022-02-20 19:58:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:12,049 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:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:12,049 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:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1024 transitions. [2022-02-20 19:58:12,057 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:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1024 transitions. [2022-02-20 19:58:12,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1024 transitions. [2022-02-20 19:58:12,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1024 edges. 1024 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:12,820 INFO L225 Difference]: With dead ends: 891 [2022-02-20 19:58:12,820 INFO L226 Difference]: Without dead ends: 714 [2022-02-20 19:58:12,821 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:12,821 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 1354 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:12,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1384 Valid, 2323 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-02-20 19:58:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 640. [2022-02-20 19:58:12,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:12,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:12,844 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:12,845 INFO L87 Difference]: Start difference. First operand 714 states. Second operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,868 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2022-02-20 19:58:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1055 transitions. [2022-02-20 19:58:12,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:12,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:12,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 714 states. [2022-02-20 19:58:12,874 INFO L87 Difference]: Start difference. First operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 714 states. [2022-02-20 19:58:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,897 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2022-02-20 19:58:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1055 transitions. [2022-02-20 19:58:12,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:12,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:12,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:12,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 546 states have (on average 1.5) internal successors, (819), 554 states have internal predecessors, (819), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:58:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 952 transitions. [2022-02-20 19:58:12,935 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 952 transitions. Word has length 65 [2022-02-20 19:58:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:12,935 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 952 transitions. [2022-02-20 19:58:12,935 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:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 952 transitions. [2022-02-20 19:58:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:12,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:12,937 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:12,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:12,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:12,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1328067777, now seen corresponding path program 1 times [2022-02-20 19:58:12,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:12,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863243913] [2022-02-20 19:58:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:12,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {7357#(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); {7318#true} is VALID [2022-02-20 19:58:12,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:12,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7318#true} {7318#true} #1772#return; {7318#true} is VALID [2022-02-20 19:58:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:12,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {7358#(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); {7318#true} is VALID [2022-02-20 19:58:12,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume !(0 == ~q_write_ev~0); {7318#true} is VALID [2022-02-20 19:58:12,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:12,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #1774#return; {7318#true} is VALID [2022-02-20 19:58:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc ~__retres1~0; {7318#true} is VALID [2022-02-20 19:58:13,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume !(1 == ~p_dw_pc~0); {7318#true} is VALID [2022-02-20 19:58:13,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} ~__retres1~0 := 0; {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:13,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,067 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7318#true} #1768#return; {7366#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume 1 == ~c_dr_pc~0; {7318#true} is VALID [2022-02-20 19:58:13,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7318#true} is VALID [2022-02-20 19:58:13,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {7318#true} #res := ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,076 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7318#true} {7319#false} #1770#return; {7319#false} is VALID [2022-02-20 19:58:13,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {7359#(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; {7318#true} is VALID [2022-02-20 19:58:13,083 INFO L272 TraceCheckUtils]: 1: Hoare triple {7318#true} call #t~ret8 := is_do_write_p_triggered(); {7318#true} is VALID [2022-02-20 19:58:13,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} havoc ~__retres1~0; {7318#true} is VALID [2022-02-20 19:58:13,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {7318#true} assume !(1 == ~p_dw_pc~0); {7318#true} is VALID [2022-02-20 19:58:13,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {7318#true} ~__retres1~0 := 0; {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:13,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,087 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7318#true} #1768#return; {7366#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:13,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {7366#(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; {7367#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:13,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {7367#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7319#false} is VALID [2022-02-20 19:58:13,091 INFO L272 TraceCheckUtils]: 10: Hoare triple {7319#false} call #t~ret9 := is_do_read_c_triggered(); {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {7318#true} havoc ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {7318#true} assume 1 == ~c_dr_pc~0; {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {7318#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {7318#true} #res := ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,091 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7318#true} {7319#false} #1770#return; {7319#false} is VALID [2022-02-20 19:58:13,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {7319#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7319#false} is VALID [2022-02-20 19:58:13,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {7319#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7319#false} is VALID [2022-02-20 19:58:13,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {7319#false} assume true; {7319#false} is VALID [2022-02-20 19:58:13,092 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7319#false} {7318#true} #1776#return; {7319#false} is VALID [2022-02-20 19:58:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {7358#(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); {7318#true} is VALID [2022-02-20 19:58:13,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume !(1 == ~q_write_ev~0); {7318#true} is VALID [2022-02-20 19:58:13,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7319#false} #1778#return; {7319#false} is VALID [2022-02-20 19:58:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc ~__retres1~2; {7318#true} is VALID [2022-02-20 19:58:13,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7318#true} is VALID [2022-02-20 19:58:13,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} #res := ~__retres1~2; {7318#true} is VALID [2022-02-20 19:58:13,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,101 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7318#true} {7319#false} #1780#return; {7319#false} is VALID [2022-02-20 19:58:13,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {7318#true} is VALID [2022-02-20 19:58:13,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {7318#true} is VALID [2022-02-20 19:58:13,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {7318#true} is VALID [2022-02-20 19:58:13,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {7318#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; {7318#true} is VALID [2022-02-20 19:58:13,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {7318#true} call update_channels1(); {7357#(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:13,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#(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); {7318#true} is VALID [2022-02-20 19:58:13,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,102 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7318#true} {7318#true} #1772#return; {7318#true} is VALID [2022-02-20 19:58:13,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {7318#true} assume { :begin_inline_init_threads1 } true; {7318#true} is VALID [2022-02-20 19:58:13,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {7318#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7318#true} is VALID [2022-02-20 19:58:13,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {7318#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7318#true} is VALID [2022-02-20 19:58:13,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {7318#true} assume { :end_inline_init_threads1 } true; {7318#true} is VALID [2022-02-20 19:58:13,103 INFO L272 TraceCheckUtils]: 12: Hoare triple {7318#true} call fire_delta_events1(); {7358#(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:13,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {7358#(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); {7318#true} is VALID [2022-02-20 19:58:13,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {7318#true} assume !(0 == ~q_write_ev~0); {7318#true} is VALID [2022-02-20 19:58:13,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,104 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7318#true} {7318#true} #1774#return; {7318#true} is VALID [2022-02-20 19:58:13,104 INFO L272 TraceCheckUtils]: 17: Hoare triple {7318#true} call activate_threads1(); {7359#(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:13,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {7359#(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; {7318#true} is VALID [2022-02-20 19:58:13,105 INFO L272 TraceCheckUtils]: 19: Hoare triple {7318#true} call #t~ret8 := is_do_write_p_triggered(); {7318#true} is VALID [2022-02-20 19:58:13,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {7318#true} havoc ~__retres1~0; {7318#true} is VALID [2022-02-20 19:58:13,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {7318#true} assume !(1 == ~p_dw_pc~0); {7318#true} is VALID [2022-02-20 19:58:13,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#true} ~__retres1~0 := 0; {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:13,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {7374#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:13,106 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7375#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7318#true} #1768#return; {7366#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:13,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {7366#(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; {7367#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:13,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {7367#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7319#false} is VALID [2022-02-20 19:58:13,113 INFO L272 TraceCheckUtils]: 28: Hoare triple {7319#false} call #t~ret9 := is_do_read_c_triggered(); {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {7318#true} havoc ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {7318#true} assume 1 == ~c_dr_pc~0; {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {7318#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {7318#true} #res := ~__retres1~1; {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,113 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7318#true} {7319#false} #1770#return; {7319#false} is VALID [2022-02-20 19:58:13,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {7319#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7319#false} is VALID [2022-02-20 19:58:13,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {7319#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7319#false} is VALID [2022-02-20 19:58:13,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {7319#false} assume true; {7319#false} is VALID [2022-02-20 19:58:13,114 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7319#false} {7318#true} #1776#return; {7319#false} is VALID [2022-02-20 19:58:13,114 INFO L272 TraceCheckUtils]: 39: Hoare triple {7319#false} call reset_delta_events1(); {7358#(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:13,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {7358#(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); {7318#true} is VALID [2022-02-20 19:58:13,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {7318#true} assume !(1 == ~q_write_ev~0); {7318#true} is VALID [2022-02-20 19:58:13,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,115 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7318#true} {7319#false} #1778#return; {7319#false} is VALID [2022-02-20 19:58:13,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2022-02-20 19:58:13,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {7319#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; {7319#false} is VALID [2022-02-20 19:58:13,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2022-02-20 19:58:13,115 INFO L272 TraceCheckUtils]: 47: Hoare triple {7319#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7318#true} is VALID [2022-02-20 19:58:13,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {7318#true} havoc ~__retres1~2; {7318#true} is VALID [2022-02-20 19:58:13,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {7318#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7318#true} is VALID [2022-02-20 19:58:13,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {7318#true} #res := ~__retres1~2; {7318#true} is VALID [2022-02-20 19:58:13,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {7318#true} assume true; {7318#true} is VALID [2022-02-20 19:58:13,120 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7318#true} {7319#false} #1780#return; {7319#false} is VALID [2022-02-20 19:58:13,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {7319#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; {7319#false} is VALID [2022-02-20 19:58:13,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {7319#false} assume 0 != eval1_~tmp___1~0#1; {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {7319#false} assume !(0 == ~p_dw_st~0); {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {7319#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; {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {7319#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; {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {7319#false} assume 0 == ~c_dr_pc~0; {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 59: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 60: Hoare triple {7319#false} assume !(1 == ~q_free~0); {7319#false} is VALID [2022-02-20 19:58:13,121 INFO L290 TraceCheckUtils]: 61: Hoare triple {7319#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; {7319#false} is VALID [2022-02-20 19:58:13,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {7319#false} assume !(~p_last_write~0 == ~c_last_read~0); {7319#false} is VALID [2022-02-20 19:58:13,122 INFO L272 TraceCheckUtils]: 63: Hoare triple {7319#false} call error1(); {7319#false} is VALID [2022-02-20 19:58:13,122 INFO L290 TraceCheckUtils]: 64: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2022-02-20 19:58:13,124 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:13,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:13,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863243913] [2022-02-20 19:58:13,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863243913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:13,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:13,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:13,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726093348] [2022-02-20 19:58:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:13,126 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:13,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:13,126 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:13,162 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:13,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:13,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:13,163 INFO L87 Difference]: Start difference. First operand 640 states and 952 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:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:16,527 INFO L93 Difference]: Finished difference Result 941 states and 1366 transitions. [2022-02-20 19:58:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:16,527 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:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:16,528 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:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 842 transitions. [2022-02-20 19:58:16,533 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:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 842 transitions. [2022-02-20 19:58:16,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 842 transitions. [2022-02-20 19:58:17,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 842 edges. 842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:17,093 INFO L225 Difference]: With dead ends: 941 [2022-02-20 19:58:17,093 INFO L226 Difference]: Without dead ends: 674 [2022-02-20 19:58:17,094 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:17,095 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 909 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:17,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 2666 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-02-20 19:58:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 645. [2022-02-20 19:58:17,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:17,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:17,127 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:17,128 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,153 INFO L93 Difference]: Finished difference Result 674 states and 996 transitions. [2022-02-20 19:58:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 996 transitions. [2022-02-20 19:58:17,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:17,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:17,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 674 states. [2022-02-20 19:58:17,161 INFO L87 Difference]: Start difference. First operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 674 states. [2022-02-20 19:58:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,189 INFO L93 Difference]: Finished difference Result 674 states and 996 transitions. [2022-02-20 19:58:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 996 transitions. [2022-02-20 19:58:17,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:17,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:17,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:17,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 558 states have internal predecessors, (821), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:58:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 955 transitions. [2022-02-20 19:58:17,218 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 955 transitions. Word has length 65 [2022-02-20 19:58:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:17,218 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 955 transitions. [2022-02-20 19:58:17,218 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:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 955 transitions. [2022-02-20 19:58:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:17,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:17,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:17,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:17,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1937540221, now seen corresponding path program 1 times [2022-02-20 19:58:17,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:17,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259353228] [2022-02-20 19:58:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {10890#(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); {10891#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:17,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#(not (= |old(~q_req_up~0)| 1))} assume true; {10891#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:17,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10891#(not (= |old(~q_req_up~0)| 1))} {10851#(= ~c_dr_pc~0 ~q_req_up~0)} #1772#return; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {10892#(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); {10848#true} is VALID [2022-02-20 19:58:17,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume !(0 == ~q_write_ev~0); {10848#true} is VALID [2022-02-20 19:58:17,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10855#(not (= ~c_dr_pc~0 1))} #1774#return; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {10848#true} havoc ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume !(1 == ~p_dw_pc~0); {10848#true} is VALID [2022-02-20 19:58:17,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} ~__retres1~0 := 0; {10848#true} is VALID [2022-02-20 19:58:17,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {10848#true} #res := ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,352 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10848#true} {10848#true} #1768#return; {10848#true} is VALID [2022-02-20 19:58:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {10848#true} havoc ~__retres1~1; {10848#true} is VALID [2022-02-20 19:58:17,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume 1 == ~c_dr_pc~0; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,360 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} {10848#true} #1770#return; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {10893#(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; {10848#true} is VALID [2022-02-20 19:58:17,361 INFO L272 TraceCheckUtils]: 1: Hoare triple {10848#true} call #t~ret8 := is_do_write_p_triggered(); {10848#true} is VALID [2022-02-20 19:58:17,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} havoc ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {10848#true} assume !(1 == ~p_dw_pc~0); {10848#true} is VALID [2022-02-20 19:58:17,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {10848#true} ~__retres1~0 := 0; {10848#true} is VALID [2022-02-20 19:58:17,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {10848#true} #res := ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10848#true} {10848#true} #1768#return; {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {10848#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {10848#true} assume !(0 != ~tmp~1); {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L272 TraceCheckUtils]: 10: Hoare triple {10848#true} call #t~ret9 := is_do_read_c_triggered(); {10848#true} is VALID [2022-02-20 19:58:17,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {10848#true} havoc ~__retres1~1; {10848#true} is VALID [2022-02-20 19:58:17,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {10848#true} assume 1 == ~c_dr_pc~0; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} {10848#true} #1770#return; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,370 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} {10855#(not (= ~c_dr_pc~0 1))} #1776#return; {10849#false} is VALID [2022-02-20 19:58:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {10892#(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); {10848#true} is VALID [2022-02-20 19:58:17,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume !(1 == ~q_write_ev~0); {10848#true} is VALID [2022-02-20 19:58:17,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10848#true} {10849#false} #1778#return; {10849#false} is VALID [2022-02-20 19:58:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:17,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {10848#true} havoc ~__retres1~2; {10848#true} is VALID [2022-02-20 19:58:17,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {10848#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10848#true} is VALID [2022-02-20 19:58:17,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {10848#true} #res := ~__retres1~2; {10848#true} is VALID [2022-02-20 19:58:17,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,385 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10848#true} {10849#false} #1780#return; {10849#false} is VALID [2022-02-20 19:58:17,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {10848#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {10850#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:17,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {10850#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {10850#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:17,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {10850#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {10851#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:17,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {10851#(= ~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; {10851#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:17,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {10851#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {10890#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:17,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {10890#(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); {10891#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:17,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {10891#(not (= |old(~q_req_up~0)| 1))} assume true; {10891#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:17,389 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10891#(not (= |old(~q_req_up~0)| 1))} {10851#(= ~c_dr_pc~0 ~q_req_up~0)} #1772#return; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {10892#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:17,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {10892#(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); {10848#true} is VALID [2022-02-20 19:58:17,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {10848#true} assume !(0 == ~q_write_ev~0); {10848#true} is VALID [2022-02-20 19:58:17,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,392 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10848#true} {10855#(not (= ~c_dr_pc~0 1))} #1774#return; {10855#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:17,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {10855#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:17,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {10893#(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; {10848#true} is VALID [2022-02-20 19:58:17,393 INFO L272 TraceCheckUtils]: 19: Hoare triple {10848#true} call #t~ret8 := is_do_write_p_triggered(); {10848#true} is VALID [2022-02-20 19:58:17,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#true} havoc ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {10848#true} assume !(1 == ~p_dw_pc~0); {10848#true} is VALID [2022-02-20 19:58:17,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {10848#true} ~__retres1~0 := 0; {10848#true} is VALID [2022-02-20 19:58:17,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {10848#true} #res := ~__retres1~0; {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10848#true} {10848#true} #1768#return; {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {10848#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {10848#true} assume !(0 != ~tmp~1); {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L272 TraceCheckUtils]: 28: Hoare triple {10848#true} call #t~ret9 := is_do_read_c_triggered(); {10848#true} is VALID [2022-02-20 19:58:17,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {10848#true} havoc ~__retres1~1; {10848#true} is VALID [2022-02-20 19:58:17,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {10848#true} assume 1 == ~c_dr_pc~0; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,396 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} {10848#true} #1770#return; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:17,398 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10906#(= (+ (- 1) ~c_dr_pc~0) 0)} {10855#(not (= ~c_dr_pc~0 1))} #1776#return; {10849#false} is VALID [2022-02-20 19:58:17,398 INFO L272 TraceCheckUtils]: 39: Hoare triple {10849#false} call reset_delta_events1(); {10892#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:17,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {10892#(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); {10848#true} is VALID [2022-02-20 19:58:17,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {10848#true} assume !(1 == ~q_write_ev~0); {10848#true} is VALID [2022-02-20 19:58:17,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,398 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10848#true} {10849#false} #1778#return; {10849#false} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {10849#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; {10849#false} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-02-20 19:58:17,399 INFO L272 TraceCheckUtils]: 47: Hoare triple {10849#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10848#true} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {10848#true} havoc ~__retres1~2; {10848#true} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {10848#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10848#true} is VALID [2022-02-20 19:58:17,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {10848#true} #res := ~__retres1~2; {10848#true} is VALID [2022-02-20 19:58:17,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {10848#true} assume true; {10848#true} is VALID [2022-02-20 19:58:17,400 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10848#true} {10849#false} #1780#return; {10849#false} is VALID [2022-02-20 19:58:17,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {10849#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; {10849#false} is VALID [2022-02-20 19:58:17,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {10849#false} assume 0 != eval1_~tmp___1~0#1; {10849#false} is VALID [2022-02-20 19:58:17,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {10849#false} assume !(0 == ~p_dw_st~0); {10849#false} is VALID [2022-02-20 19:58:17,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {10849#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; {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {10849#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; {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {10849#false} assume 0 == ~c_dr_pc~0; {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {10849#false} assume !(1 == ~q_free~0); {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 61: Hoare triple {10849#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; {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {10849#false} assume !(~p_last_write~0 == ~c_last_read~0); {10849#false} is VALID [2022-02-20 19:58:17,401 INFO L272 TraceCheckUtils]: 63: Hoare triple {10849#false} call error1(); {10849#false} is VALID [2022-02-20 19:58:17,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {10849#false} assume !false; {10849#false} is VALID [2022-02-20 19:58:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:17,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:17,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259353228] [2022-02-20 19:58:17,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259353228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:17,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:17,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:17,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378850471] [2022-02-20 19:58:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:17,405 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:17,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:17,407 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:17,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:17,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:17,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:17,444 INFO L87 Difference]: Start difference. First operand 645 states and 955 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:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:23,062 INFO L93 Difference]: Finished difference Result 1967 states and 2751 transitions. [2022-02-20 19:58:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:23,063 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:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:23,063 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:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1360 transitions. [2022-02-20 19:58:23,072 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:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1360 transitions. [2022-02-20 19:58:23,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1360 transitions. [2022-02-20 19:58:23,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1360 edges. 1360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:24,098 INFO L225 Difference]: With dead ends: 1967 [2022-02-20 19:58:24,098 INFO L226 Difference]: Without dead ends: 1677 [2022-02-20 19:58:24,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:24,107 INFO L933 BasicCegarLoop]: 770 mSDtfsCounter, 3450 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3468 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:24,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3468 Valid, 2824 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:58:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-02-20 19:58:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1546. [2022-02-20 19:58:24,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:24,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1677 states. Second operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:24,179 INFO L74 IsIncluded]: Start isIncluded. First operand 1677 states. Second operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:24,181 INFO L87 Difference]: Start difference. First operand 1677 states. Second operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,273 INFO L93 Difference]: Finished difference Result 1677 states and 2245 transitions. [2022-02-20 19:58:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2245 transitions. [2022-02-20 19:58:24,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1677 states. [2022-02-20 19:58:24,281 INFO L87 Difference]: Start difference. First operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1677 states. [2022-02-20 19:58:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,388 INFO L93 Difference]: Finished difference Result 1677 states and 2245 transitions. [2022-02-20 19:58:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2245 transitions. [2022-02-20 19:58:24,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:24,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1288 states have internal predecessors, (1760), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:58:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2096 transitions. [2022-02-20 19:58:24,507 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2096 transitions. Word has length 65 [2022-02-20 19:58:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:24,507 INFO L470 AbstractCegarLoop]: Abstraction has 1546 states and 2096 transitions. [2022-02-20 19:58:24,508 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:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2096 transitions. [2022-02-20 19:58:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:24,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:24,509 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:24,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:24,509 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1305977986, now seen corresponding path program 1 times [2022-02-20 19:58:24,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217986073] [2022-02-20 19:58:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {19071#(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); {19032#true} is VALID [2022-02-20 19:58:24,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19032#true} {19032#true} #1772#return; {19032#true} is VALID [2022-02-20 19:58:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {19072#(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); {19032#true} is VALID [2022-02-20 19:58:24,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume !(0 == ~q_write_ev~0); {19032#true} is VALID [2022-02-20 19:58:24,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19032#true} {19032#true} #1774#return; {19032#true} is VALID [2022-02-20 19:58:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {19032#true} havoc ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume !(1 == ~p_dw_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} ~__retres1~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {19032#true} #res := ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,590 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19032#true} {19032#true} #1768#return; {19032#true} is VALID [2022-02-20 19:58:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {19032#true} havoc ~__retres1~1; {19032#true} is VALID [2022-02-20 19:58:24,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume !(1 == ~c_dr_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} ~__retres1~1 := 0; {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:24,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,618 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19032#true} #1770#return; {19086#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {19073#(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; {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L272 TraceCheckUtils]: 1: Hoare triple {19032#true} call #t~ret8 := is_do_write_p_triggered(); {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} havoc ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {19032#true} assume !(1 == ~p_dw_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {19032#true} ~__retres1~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {19032#true} #res := ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19032#true} {19032#true} #1768#return; {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {19032#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {19032#true} assume !(0 != ~tmp~1); {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L272 TraceCheckUtils]: 10: Hoare triple {19032#true} call #t~ret9 := is_do_read_c_triggered(); {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {19032#true} havoc ~__retres1~1; {19032#true} is VALID [2022-02-20 19:58:24,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {19032#true} assume !(1 == ~c_dr_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {19032#true} ~__retres1~1 := 0; {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:24,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19032#true} #1770#return; {19086#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:24,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {19086#(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; {19087#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:24,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {19087#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19033#false} is VALID [2022-02-20 19:58:24,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {19033#false} assume true; {19033#false} is VALID [2022-02-20 19:58:24,623 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19033#false} {19032#true} #1776#return; {19033#false} is VALID [2022-02-20 19:58:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {19072#(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); {19032#true} is VALID [2022-02-20 19:58:24,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume !(1 == ~q_write_ev~0); {19032#true} is VALID [2022-02-20 19:58:24,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19032#true} {19033#false} #1778#return; {19033#false} is VALID [2022-02-20 19:58:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {19032#true} havoc ~__retres1~2; {19032#true} is VALID [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19032#true} is VALID [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} #res := ~__retres1~2; {19032#true} is VALID [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,632 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19032#true} {19033#false} #1780#return; {19033#false} is VALID [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {19032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {19032#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {19032#true} is VALID [2022-02-20 19:58:24,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {19032#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {19032#true} is VALID [2022-02-20 19:58:24,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {19032#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; {19032#true} is VALID [2022-02-20 19:58:24,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {19032#true} call update_channels1(); {19071#(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:24,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {19071#(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); {19032#true} is VALID [2022-02-20 19:58:24,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19032#true} {19032#true} #1772#return; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {19032#true} assume { :begin_inline_init_threads1 } true; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {19032#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {19032#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {19032#true} assume { :end_inline_init_threads1 } true; {19032#true} is VALID [2022-02-20 19:58:24,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {19032#true} call fire_delta_events1(); {19072#(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:24,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {19072#(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); {19032#true} is VALID [2022-02-20 19:58:24,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {19032#true} assume !(0 == ~q_write_ev~0); {19032#true} is VALID [2022-02-20 19:58:24,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19032#true} {19032#true} #1774#return; {19032#true} is VALID [2022-02-20 19:58:24,635 INFO L272 TraceCheckUtils]: 17: Hoare triple {19032#true} call activate_threads1(); {19073#(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:24,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {19073#(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; {19032#true} is VALID [2022-02-20 19:58:24,635 INFO L272 TraceCheckUtils]: 19: Hoare triple {19032#true} call #t~ret8 := is_do_write_p_triggered(); {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {19032#true} havoc ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {19032#true} assume !(1 == ~p_dw_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {19032#true} ~__retres1~0 := 0; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {19032#true} #res := ~__retres1~0; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19032#true} {19032#true} #1768#return; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {19032#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {19032#true} assume !(0 != ~tmp~1); {19032#true} is VALID [2022-02-20 19:58:24,636 INFO L272 TraceCheckUtils]: 28: Hoare triple {19032#true} call #t~ret9 := is_do_read_c_triggered(); {19032#true} is VALID [2022-02-20 19:58:24,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {19032#true} havoc ~__retres1~1; {19032#true} is VALID [2022-02-20 19:58:24,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {19032#true} assume !(1 == ~c_dr_pc~0); {19032#true} is VALID [2022-02-20 19:58:24,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {19032#true} ~__retres1~1 := 0; {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:24,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {19088#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:24,638 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19089#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19032#true} #1770#return; {19086#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:24,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {19086#(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; {19087#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:24,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {19087#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19033#false} is VALID [2022-02-20 19:58:24,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {19033#false} assume true; {19033#false} is VALID [2022-02-20 19:58:24,639 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19033#false} {19032#true} #1776#return; {19033#false} is VALID [2022-02-20 19:58:24,639 INFO L272 TraceCheckUtils]: 39: Hoare triple {19033#false} call reset_delta_events1(); {19072#(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:24,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {19072#(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); {19032#true} is VALID [2022-02-20 19:58:24,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {19032#true} assume !(1 == ~q_write_ev~0); {19032#true} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,640 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19032#true} {19033#false} #1778#return; {19033#false} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {19033#false} assume !false; {19033#false} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {19033#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; {19033#false} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {19033#false} assume !false; {19033#false} is VALID [2022-02-20 19:58:24,640 INFO L272 TraceCheckUtils]: 47: Hoare triple {19033#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19032#true} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {19032#true} havoc ~__retres1~2; {19032#true} is VALID [2022-02-20 19:58:24,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {19032#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19032#true} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {19032#true} #res := ~__retres1~2; {19032#true} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {19032#true} assume true; {19032#true} is VALID [2022-02-20 19:58:24,641 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19032#true} {19033#false} #1780#return; {19033#false} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {19033#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; {19033#false} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {19033#false} assume 0 != eval1_~tmp___1~0#1; {19033#false} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {19033#false} assume !(0 == ~p_dw_st~0); {19033#false} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {19033#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; {19033#false} is VALID [2022-02-20 19:58:24,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {19033#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; {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {19033#false} assume 0 == ~c_dr_pc~0; {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {19033#false} assume !false; {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {19033#false} assume !(1 == ~q_free~0); {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {19033#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; {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {19033#false} assume !(~p_last_write~0 == ~c_last_read~0); {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L272 TraceCheckUtils]: 63: Hoare triple {19033#false} call error1(); {19033#false} is VALID [2022-02-20 19:58:24,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {19033#false} assume !false; {19033#false} is VALID [2022-02-20 19:58:24,643 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:24,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:24,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217986073] [2022-02-20 19:58:24,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217986073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:24,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:24,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:24,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599654595] [2022-02-20 19:58:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:24,644 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:24,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:24,644 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:24,679 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:24,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:24,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:24,680 INFO L87 Difference]: Start difference. First operand 1546 states and 2096 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:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:28,231 INFO L93 Difference]: Finished difference Result 2837 states and 3769 transitions. [2022-02-20 19:58:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:28,231 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:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:28,232 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:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 841 transitions. [2022-02-20 19:58:28,237 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:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 841 transitions. [2022-02-20 19:58:28,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 841 transitions. [2022-02-20 19:58:28,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:28,894 INFO L225 Difference]: With dead ends: 2837 [2022-02-20 19:58:28,894 INFO L226 Difference]: Without dead ends: 1652 [2022-02-20 19:58:28,896 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:28,897 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 910 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:28,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [912 Valid, 2662 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2022-02-20 19:58:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1576. [2022-02-20 19:58:28,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:28,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1652 states. Second operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:28,967 INFO L74 IsIncluded]: Start isIncluded. First operand 1652 states. Second operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:28,968 INFO L87 Difference]: Start difference. First operand 1652 states. Second operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,055 INFO L93 Difference]: Finished difference Result 1652 states and 2209 transitions. [2022-02-20 19:58:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2209 transitions. [2022-02-20 19:58:29,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:29,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:29,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1652 states. [2022-02-20 19:58:29,062 INFO L87 Difference]: Start difference. First operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1652 states. [2022-02-20 19:58:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,153 INFO L93 Difference]: Finished difference Result 1652 states and 2209 transitions. [2022-02-20 19:58:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2209 transitions. [2022-02-20 19:58:29,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:29,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:29,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:29,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1312 states have internal predecessors, (1776), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:58:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2118 transitions. [2022-02-20 19:58:29,289 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2118 transitions. Word has length 65 [2022-02-20 19:58:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:29,290 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2118 transitions. [2022-02-20 19:58:29,290 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:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2118 transitions. [2022-02-20 19:58:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:29,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:29,291 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:29,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:29,291 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 80225408, now seen corresponding path program 1 times [2022-02-20 19:58:29,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:29,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589535688] [2022-02-20 19:58:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {28361#(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); {28321#true} is VALID [2022-02-20 19:58:29,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28321#true} {28321#true} #1772#return; {28321#true} is VALID [2022-02-20 19:58:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {28362#(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); {28321#true} is VALID [2022-02-20 19:58:29,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume !(0 == ~q_write_ev~0); {28321#true} is VALID [2022-02-20 19:58:29,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28321#true} {28326#(= ~p_dw_st~0 0)} #1774#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {28321#true} havoc ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume !(1 == ~p_dw_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} ~__retres1~0 := 0; {28321#true} is VALID [2022-02-20 19:58:29,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {28321#true} #res := ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,365 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1768#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {28321#true} havoc ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume !(1 == ~c_dr_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} ~__retres1~1 := 0; {28321#true} is VALID [2022-02-20 19:58:29,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {28321#true} #res := ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,370 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1770#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {28363#(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; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,370 INFO L272 TraceCheckUtils]: 1: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {28321#true} is VALID [2022-02-20 19:58:29,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} havoc ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {28321#true} assume !(1 == ~p_dw_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {28321#true} ~__retres1~0 := 0; {28321#true} is VALID [2022-02-20 19:58:29,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {28321#true} #res := ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,371 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1768#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,372 INFO L272 TraceCheckUtils]: 10: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {28321#true} is VALID [2022-02-20 19:58:29,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {28321#true} havoc ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {28321#true} assume !(1 == ~c_dr_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {28321#true} ~__retres1~1 := 0; {28321#true} is VALID [2022-02-20 19:58:29,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {28321#true} #res := ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1770#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,374 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {28326#(= ~p_dw_st~0 0)} #1776#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {28362#(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); {28321#true} is VALID [2022-02-20 19:58:29,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume !(1 == ~q_write_ev~0); {28321#true} is VALID [2022-02-20 19:58:29,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28321#true} {28326#(= ~p_dw_st~0 0)} #1778#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:29,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {28321#true} havoc ~__retres1~2; {28321#true} is VALID [2022-02-20 19:58:29,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {28326#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {28326#(= ~p_dw_st~0 0)} assume true; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,414 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28326#(= ~p_dw_st~0 0)} {28326#(= ~p_dw_st~0 0)} #1780#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {28321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {28321#true} is VALID [2022-02-20 19:58:29,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {28321#true} is VALID [2022-02-20 19:58:29,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {28321#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {28321#true} is VALID [2022-02-20 19:58:29,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {28321#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; {28321#true} is VALID [2022-02-20 19:58:29,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {28321#true} call update_channels1(); {28361#(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:29,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {28361#(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); {28321#true} is VALID [2022-02-20 19:58:29,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,416 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28321#true} {28321#true} #1772#return; {28321#true} is VALID [2022-02-20 19:58:29,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {28321#true} assume { :begin_inline_init_threads1 } true; {28321#true} is VALID [2022-02-20 19:58:29,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {28321#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {28326#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {28326#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,417 INFO L272 TraceCheckUtils]: 12: Hoare triple {28326#(= ~p_dw_st~0 0)} call fire_delta_events1(); {28362#(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:29,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {28362#(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); {28321#true} is VALID [2022-02-20 19:58:29,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {28321#true} assume !(0 == ~q_write_ev~0); {28321#true} is VALID [2022-02-20 19:58:29,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,418 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28321#true} {28326#(= ~p_dw_st~0 0)} #1774#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,418 INFO L272 TraceCheckUtils]: 17: Hoare triple {28326#(= ~p_dw_st~0 0)} call activate_threads1(); {28363#(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:29,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {28363#(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; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,419 INFO L272 TraceCheckUtils]: 19: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {28321#true} is VALID [2022-02-20 19:58:29,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {28321#true} havoc ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {28321#true} assume !(1 == ~p_dw_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {28321#true} ~__retres1~0 := 0; {28321#true} is VALID [2022-02-20 19:58:29,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {28321#true} #res := ~__retres1~0; {28321#true} is VALID [2022-02-20 19:58:29,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,420 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1768#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,420 INFO L272 TraceCheckUtils]: 28: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {28321#true} is VALID [2022-02-20 19:58:29,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {28321#true} havoc ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {28321#true} assume !(1 == ~c_dr_pc~0); {28321#true} is VALID [2022-02-20 19:58:29,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {28321#true} ~__retres1~1 := 0; {28321#true} is VALID [2022-02-20 19:58:29,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {28321#true} #res := ~__retres1~1; {28321#true} is VALID [2022-02-20 19:58:29,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,421 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28321#true} {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1770#return; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:29,422 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28364#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {28326#(= ~p_dw_st~0 0)} #1776#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,423 INFO L272 TraceCheckUtils]: 39: Hoare triple {28326#(= ~p_dw_st~0 0)} call reset_delta_events1(); {28362#(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:29,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {28362#(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); {28321#true} is VALID [2022-02-20 19:58:29,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {28321#true} assume !(1 == ~q_write_ev~0); {28321#true} is VALID [2022-02-20 19:58:29,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {28321#true} assume true; {28321#true} is VALID [2022-02-20 19:58:29,424 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {28321#true} {28326#(= ~p_dw_st~0 0)} #1778#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {28326#(= ~p_dw_st~0 0)} assume !false; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {28326#(= ~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; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {28326#(= ~p_dw_st~0 0)} assume !false; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,424 INFO L272 TraceCheckUtils]: 47: Hoare triple {28326#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28321#true} is VALID [2022-02-20 19:58:29,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {28321#true} havoc ~__retres1~2; {28321#true} is VALID [2022-02-20 19:58:29,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {28321#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {28326#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {28326#(= ~p_dw_st~0 0)} assume true; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,426 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28326#(= ~p_dw_st~0 0)} {28326#(= ~p_dw_st~0 0)} #1780#return; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {28326#(= ~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; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {28326#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {28326#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {28326#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {28322#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; {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {28322#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; {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {28322#false} assume 0 == ~c_dr_pc~0; {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {28322#false} assume !false; {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {28322#false} assume !(1 == ~q_free~0); {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {28322#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; {28322#false} is VALID [2022-02-20 19:58:29,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {28322#false} assume !(~p_last_write~0 == ~c_last_read~0); {28322#false} is VALID [2022-02-20 19:58:29,428 INFO L272 TraceCheckUtils]: 63: Hoare triple {28322#false} call error1(); {28322#false} is VALID [2022-02-20 19:58:29,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {28322#false} assume !false; {28322#false} is VALID [2022-02-20 19:58:29,428 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:29,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:29,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589535688] [2022-02-20 19:58:29,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589535688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:29,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:29,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:29,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626236542] [2022-02-20 19:58:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:29,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:29,430 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:29,461 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:29,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:29,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:29,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:29,462 INFO L87 Difference]: Start difference. First operand 1576 states and 2118 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:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,878 INFO L93 Difference]: Finished difference Result 4012 states and 5222 transitions. [2022-02-20 19:58:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:31,879 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:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:31,879 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:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 961 transitions. [2022-02-20 19:58:31,884 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:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 961 transitions. [2022-02-20 19:58:31,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 961 transitions. [2022-02-20 19:58:32,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 961 edges. 961 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:32,884 INFO L225 Difference]: With dead ends: 4012 [2022-02-20 19:58:32,884 INFO L226 Difference]: Without dead ends: 2798 [2022-02-20 19:58:32,886 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:32,887 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 1657 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:32,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1688 Valid, 1619 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2022-02-20 19:58:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2690. [2022-02-20 19:58:33,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:33,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2798 states. Second operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) [2022-02-20 19:58:33,057 INFO L74 IsIncluded]: Start isIncluded. First operand 2798 states. Second operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) [2022-02-20 19:58:33,060 INFO L87 Difference]: Start difference. First operand 2798 states. Second operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) [2022-02-20 19:58:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:33,263 INFO L93 Difference]: Finished difference Result 2798 states and 3611 transitions. [2022-02-20 19:58:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3611 transitions. [2022-02-20 19:58:33,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:33,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:33,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) Second operand 2798 states. [2022-02-20 19:58:33,275 INFO L87 Difference]: Start difference. First operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) Second operand 2798 states. [2022-02-20 19:58:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:33,481 INFO L93 Difference]: Finished difference Result 2798 states and 3611 transitions. [2022-02-20 19:58:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3611 transitions. [2022-02-20 19:58:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:33,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:33,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2144 states have (on average 1.3129664179104477) internal successors, (2815), 2189 states have internal predecessors, (2815), 274 states have call successors, (274), 215 states have call predecessors, (274), 270 states have return successors, (401), 290 states have call predecessors, (401), 272 states have call successors, (401) [2022-02-20 19:58:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3490 transitions. [2022-02-20 19:58:33,791 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3490 transitions. Word has length 65 [2022-02-20 19:58:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:33,792 INFO L470 AbstractCegarLoop]: Abstraction has 2690 states and 3490 transitions. [2022-02-20 19:58:33,792 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:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3490 transitions. [2022-02-20 19:58:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:33,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:33,795 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:33,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:33,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1125374181, now seen corresponding path program 1 times [2022-02-20 19:58:33,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:33,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348713364] [2022-02-20 19:58:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {43022#(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); {42982#true} is VALID [2022-02-20 19:58:33,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1772#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {43023#(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); {42982#true} is VALID [2022-02-20 19:58:33,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume !(0 == ~q_write_ev~0); {42982#true} is VALID [2022-02-20 19:58:33,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1774#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {42982#true} havoc ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume !(1 == ~p_dw_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} ~__retres1~0 := 0; {42982#true} is VALID [2022-02-20 19:58:33,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {42982#true} #res := ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,857 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42982#true} {42982#true} #1768#return; {42982#true} is VALID [2022-02-20 19:58:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {42982#true} havoc ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume !(1 == ~c_dr_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} ~__retres1~1 := 0; {42982#true} is VALID [2022-02-20 19:58:33,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {42982#true} #res := ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,859 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42982#true} {42982#true} #1770#return; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {43024#(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; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L272 TraceCheckUtils]: 1: Hoare triple {42982#true} call #t~ret8 := is_do_write_p_triggered(); {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} havoc ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {42982#true} assume !(1 == ~p_dw_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {42982#true} ~__retres1~0 := 0; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {42982#true} #res := ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,860 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42982#true} {42982#true} #1768#return; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {42982#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {42982#true} assume !(0 != ~tmp~1); {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L272 TraceCheckUtils]: 10: Hoare triple {42982#true} call #t~ret9 := is_do_read_c_triggered(); {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {42982#true} havoc ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {42982#true} assume !(1 == ~c_dr_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {42982#true} ~__retres1~1 := 0; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {42982#true} #res := ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,861 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42982#true} {42982#true} #1770#return; {42982#true} is VALID [2022-02-20 19:58:33,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {42982#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42982#true} is VALID [2022-02-20 19:58:33,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {42982#true} assume !(0 != ~tmp___0~1); {42982#true} is VALID [2022-02-20 19:58:33,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,862 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1776#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {43023#(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); {42982#true} is VALID [2022-02-20 19:58:33,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume !(1 == ~q_write_ev~0); {42982#true} is VALID [2022-02-20 19:58:33,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1778#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:33,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {42982#true} havoc ~__retres1~2; {42982#true} is VALID [2022-02-20 19:58:33,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42982#true} is VALID [2022-02-20 19:58:33,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} #res := ~__retres1~2; {42982#true} is VALID [2022-02-20 19:58:33,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,875 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1780#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {42982#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {42982#true} is VALID [2022-02-20 19:58:33,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {42982#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {42982#true} is VALID [2022-02-20 19:58:33,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {42982#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {42984#(= ~q_free~0 1)} call update_channels1(); {43022#(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:33,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {43022#(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); {42982#true} is VALID [2022-02-20 19:58:33,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,877 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1772#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {42984#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {42984#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {42984#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {42984#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {42984#(= ~q_free~0 1)} call fire_delta_events1(); {43023#(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:33,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {43023#(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); {42982#true} is VALID [2022-02-20 19:58:33,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {42982#true} assume !(0 == ~q_write_ev~0); {42982#true} is VALID [2022-02-20 19:58:33,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1774#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,880 INFO L272 TraceCheckUtils]: 17: Hoare triple {42984#(= ~q_free~0 1)} call activate_threads1(); {43024#(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:33,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {43024#(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; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {42982#true} call #t~ret8 := is_do_write_p_triggered(); {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {42982#true} havoc ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {42982#true} assume !(1 == ~p_dw_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {42982#true} ~__retres1~0 := 0; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {42982#true} #res := ~__retres1~0; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,880 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {42982#true} {42982#true} #1768#return; {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {42982#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {42982#true} assume !(0 != ~tmp~1); {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L272 TraceCheckUtils]: 28: Hoare triple {42982#true} call #t~ret9 := is_do_read_c_triggered(); {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {42982#true} havoc ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {42982#true} assume !(1 == ~c_dr_pc~0); {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {42982#true} ~__retres1~1 := 0; {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {42982#true} #res := ~__retres1~1; {42982#true} is VALID [2022-02-20 19:58:33,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,882 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {42982#true} {42982#true} #1770#return; {42982#true} is VALID [2022-02-20 19:58:33,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {42982#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42982#true} is VALID [2022-02-20 19:58:33,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {42982#true} assume !(0 != ~tmp___0~1); {42982#true} is VALID [2022-02-20 19:58:33,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,882 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1776#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,883 INFO L272 TraceCheckUtils]: 39: Hoare triple {42984#(= ~q_free~0 1)} call reset_delta_events1(); {43023#(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:33,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {43023#(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); {42982#true} is VALID [2022-02-20 19:58:33,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {42982#true} assume !(1 == ~q_write_ev~0); {42982#true} is VALID [2022-02-20 19:58:33,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,883 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1778#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {42984#(= ~q_free~0 1)} assume !false; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {42984#(= ~q_free~0 1)} assume !false; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,884 INFO L272 TraceCheckUtils]: 47: Hoare triple {42984#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42982#true} is VALID [2022-02-20 19:58:33,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {42982#true} havoc ~__retres1~2; {42982#true} is VALID [2022-02-20 19:58:33,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {42982#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42982#true} is VALID [2022-02-20 19:58:33,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {42982#true} #res := ~__retres1~2; {42982#true} is VALID [2022-02-20 19:58:33,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {42982#true} assume true; {42982#true} is VALID [2022-02-20 19:58:33,885 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {42982#true} {42984#(= ~q_free~0 1)} #1780#return; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {42984#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,886 INFO L290 TraceCheckUtils]: 55: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {42984#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {42984#(= ~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; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {42984#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {42984#(= ~q_free~0 1)} assume !false; {42984#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:33,888 INFO L290 TraceCheckUtils]: 61: Hoare triple {42984#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {42983#false} is VALID [2022-02-20 19:58:33,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {42983#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; {42983#false} is VALID [2022-02-20 19:58:33,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {42983#false} assume !(~p_last_write~0 == ~c_last_read~0); {42983#false} is VALID [2022-02-20 19:58:33,888 INFO L272 TraceCheckUtils]: 64: Hoare triple {42983#false} call error1(); {42983#false} is VALID [2022-02-20 19:58:33,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {42983#false} assume !false; {42983#false} is VALID [2022-02-20 19:58:33,888 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:33,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:33,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348713364] [2022-02-20 19:58:33,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348713364] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:33,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:33,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:33,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79822288] [2022-02-20 19:58:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:33,890 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:33,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:33,890 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:33,927 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:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:33,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:33,929 INFO L87 Difference]: Start difference. First operand 2690 states and 3490 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:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,054 INFO L93 Difference]: Finished difference Result 6082 states and 7754 transitions. [2022-02-20 19:58:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:37,054 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:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:37,054 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:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-02-20 19:58:37,059 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:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-02-20 19:58:37,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 950 transitions. [2022-02-20 19:58:37,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:38,287 INFO L225 Difference]: With dead ends: 6082 [2022-02-20 19:58:38,287 INFO L226 Difference]: Without dead ends: 3759 [2022-02-20 19:58:38,290 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:38,291 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 1124 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:38,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1133 Valid, 1609 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2022-02-20 19:58:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3503. [2022-02-20 19:58:38,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:38,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3759 states. Second operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) [2022-02-20 19:58:38,481 INFO L74 IsIncluded]: Start isIncluded. First operand 3759 states. Second operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) [2022-02-20 19:58:38,485 INFO L87 Difference]: Start difference. First operand 3759 states. Second operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) [2022-02-20 19:58:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:38,915 INFO L93 Difference]: Finished difference Result 3759 states and 4771 transitions. [2022-02-20 19:58:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 4771 transitions. [2022-02-20 19:58:38,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:38,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:38,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) Second operand 3759 states. [2022-02-20 19:58:38,930 INFO L87 Difference]: Start difference. First operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) Second operand 3759 states. [2022-02-20 19:58:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,400 INFO L93 Difference]: Finished difference Result 3759 states and 4771 transitions. [2022-02-20 19:58:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 4771 transitions. [2022-02-20 19:58:39,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:39,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 2773 states have (on average 1.294626758023801) internal successors, (3590), 2825 states have internal predecessors, (3590), 364 states have call successors, (364), 293 states have call predecessors, (364), 364 states have return successors, (515), 389 states have call predecessors, (515), 362 states have call successors, (515) [2022-02-20 19:58:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4469 transitions. [2022-02-20 19:58:39,946 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4469 transitions. Word has length 66 [2022-02-20 19:58:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:39,947 INFO L470 AbstractCegarLoop]: Abstraction has 3503 states and 4469 transitions. [2022-02-20 19:58:39,947 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:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4469 transitions. [2022-02-20 19:58:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:39,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:39,948 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:39,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:39,949 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash 242787514, now seen corresponding path program 1 times [2022-02-20 19:58:39,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:39,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52381398] [2022-02-20 19:58:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {63463#(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); {63423#true} is VALID [2022-02-20 19:58:39,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:39,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1772#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {63464#(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); {63423#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume !(0 == ~q_write_ev~0); {63423#true} is VALID [2022-02-20 19:58:40,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1774#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {63423#true} havoc ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume !(1 == ~p_dw_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} ~__retres1~0 := 0; {63423#true} is VALID [2022-02-20 19:58:40,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {63423#true} #res := ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,020 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63423#true} {63423#true} #1768#return; {63423#true} is VALID [2022-02-20 19:58:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {63423#true} havoc ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume !(1 == ~c_dr_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} ~__retres1~1 := 0; {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {63423#true} #res := ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63423#true} {63423#true} #1770#return; {63423#true} is VALID [2022-02-20 19:58:40,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {63465#(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; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L272 TraceCheckUtils]: 1: Hoare triple {63423#true} call #t~ret8 := is_do_write_p_triggered(); {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} havoc ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {63423#true} assume !(1 == ~p_dw_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {63423#true} ~__retres1~0 := 0; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {63423#true} #res := ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63423#true} {63423#true} #1768#return; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {63423#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {63423#true} is VALID [2022-02-20 19:58:40,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {63423#true} assume !(0 != ~tmp~1); {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L272 TraceCheckUtils]: 10: Hoare triple {63423#true} call #t~ret9 := is_do_read_c_triggered(); {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {63423#true} havoc ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {63423#true} assume !(1 == ~c_dr_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {63423#true} ~__retres1~1 := 0; {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {63423#true} #res := ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63423#true} {63423#true} #1770#return; {63423#true} is VALID [2022-02-20 19:58:40,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {63423#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {63423#true} is VALID [2022-02-20 19:58:40,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {63423#true} assume !(0 != ~tmp___0~1); {63423#true} is VALID [2022-02-20 19:58:40,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,028 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1776#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {63464#(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); {63423#true} is VALID [2022-02-20 19:58:40,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume !(1 == ~q_write_ev~0); {63423#true} is VALID [2022-02-20 19:58:40,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1778#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {63423#true} havoc ~__retres1~2; {63423#true} is VALID [2022-02-20 19:58:40,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {63423#true} is VALID [2022-02-20 19:58:40,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} #res := ~__retres1~2; {63423#true} is VALID [2022-02-20 19:58:40,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,041 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1780#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {63423#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {63423#true} is VALID [2022-02-20 19:58:40,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {63423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {63423#true} is VALID [2022-02-20 19:58:40,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {63423#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {63425#(= ~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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {63425#(= ~p_dw_pc~0 0)} call update_channels1(); {63463#(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:40,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {63463#(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); {63423#true} is VALID [2022-02-20 19:58:40,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,043 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1772#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,044 INFO L272 TraceCheckUtils]: 12: Hoare triple {63425#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {63464#(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:40,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {63464#(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); {63423#true} is VALID [2022-02-20 19:58:40,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {63423#true} assume !(0 == ~q_write_ev~0); {63423#true} is VALID [2022-02-20 19:58:40,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,045 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1774#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,045 INFO L272 TraceCheckUtils]: 17: Hoare triple {63425#(= ~p_dw_pc~0 0)} call activate_threads1(); {63465#(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:40,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {63465#(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; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L272 TraceCheckUtils]: 19: Hoare triple {63423#true} call #t~ret8 := is_do_write_p_triggered(); {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {63423#true} havoc ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {63423#true} assume !(1 == ~p_dw_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {63423#true} ~__retres1~0 := 0; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {63423#true} #res := ~__retres1~0; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {63423#true} {63423#true} #1768#return; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {63423#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {63423#true} is VALID [2022-02-20 19:58:40,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {63423#true} assume !(0 != ~tmp~1); {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {63423#true} call #t~ret9 := is_do_read_c_triggered(); {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {63423#true} havoc ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {63423#true} assume !(1 == ~c_dr_pc~0); {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {63423#true} ~__retres1~1 := 0; {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {63423#true} #res := ~__retres1~1; {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {63423#true} {63423#true} #1770#return; {63423#true} is VALID [2022-02-20 19:58:40,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {63423#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {63423#true} is VALID [2022-02-20 19:58:40,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {63423#true} assume !(0 != ~tmp___0~1); {63423#true} is VALID [2022-02-20 19:58:40,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,048 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1776#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,048 INFO L272 TraceCheckUtils]: 39: Hoare triple {63425#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {63464#(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:40,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {63464#(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); {63423#true} is VALID [2022-02-20 19:58:40,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {63423#true} assume !(1 == ~q_write_ev~0); {63423#true} is VALID [2022-02-20 19:58:40,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,049 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1778#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume !false; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {63425#(= ~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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume !false; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,050 INFO L272 TraceCheckUtils]: 47: Hoare triple {63425#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {63423#true} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {63423#true} havoc ~__retres1~2; {63423#true} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {63423#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {63423#true} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {63423#true} #res := ~__retres1~2; {63423#true} is VALID [2022-02-20 19:58:40,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {63423#true} assume true; {63423#true} is VALID [2022-02-20 19:58:40,051 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {63423#true} {63425#(= ~p_dw_pc~0 0)} #1780#return; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {63425#(= ~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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {63425#(= ~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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {63425#(= ~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; {63425#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:40,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {63425#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {63424#false} is VALID [2022-02-20 19:58:40,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {63424#false} assume 1 == ~p_dw_pc~0; {63424#false} is VALID [2022-02-20 19:58:40,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {63424#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; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {63424#false} assume !false; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {63424#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {63424#false} assume { :end_inline_do_write_p } true; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {63424#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; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {63424#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; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {63424#false} assume 0 == ~c_dr_pc~0; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {63424#false} assume !false; {63424#false} is VALID [2022-02-20 19:58:40,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {63424#false} assume !(1 == ~q_free~0); {63424#false} is VALID [2022-02-20 19:58:40,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {63424#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; {63424#false} is VALID [2022-02-20 19:58:40,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {63424#false} assume !(~p_last_write~0 == ~c_last_read~0); {63424#false} is VALID [2022-02-20 19:58:40,054 INFO L272 TraceCheckUtils]: 70: Hoare triple {63424#false} call error1(); {63424#false} is VALID [2022-02-20 19:58:40,054 INFO L290 TraceCheckUtils]: 71: Hoare triple {63424#false} assume !false; {63424#false} is VALID [2022-02-20 19:58:40,054 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:40,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:40,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52381398] [2022-02-20 19:58:40,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52381398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:40,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:40,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:40,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625167628] [2022-02-20 19:58:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:40,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:40,056 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:40,096 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:40,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:40,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:40,098 INFO L87 Difference]: Start difference. First operand 3503 states and 4469 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:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,927 INFO L93 Difference]: Finished difference Result 7452 states and 9371 transitions. [2022-02-20 19:58:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:43,927 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:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:43,928 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:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-02-20 19:58:43,932 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:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-02-20 19:58:43,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 947 transitions. [2022-02-20 19:58:44,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 947 edges. 947 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:45,302 INFO L225 Difference]: With dead ends: 7452 [2022-02-20 19:58:45,302 INFO L226 Difference]: Without dead ends: 4314 [2022-02-20 19:58:45,306 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:45,306 INFO L933 BasicCegarLoop]: 693 mSDtfsCounter, 1293 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:45,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 1688 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-02-20 19:58:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4066. [2022-02-20 19:58:45,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:45,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4314 states. Second operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) [2022-02-20 19:58:45,531 INFO L74 IsIncluded]: Start isIncluded. First operand 4314 states. Second operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) [2022-02-20 19:58:45,535 INFO L87 Difference]: Start difference. First operand 4314 states. Second operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) [2022-02-20 19:58:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:46,053 INFO L93 Difference]: Finished difference Result 4314 states and 5438 transitions. [2022-02-20 19:58:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 5438 transitions. [2022-02-20 19:58:46,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:46,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:46,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) Second operand 4314 states. [2022-02-20 19:58:46,070 INFO L87 Difference]: Start difference. First operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) Second operand 4314 states. [2022-02-20 19:58:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:46,577 INFO L93 Difference]: Finished difference Result 4314 states and 5438 transitions. [2022-02-20 19:58:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 5438 transitions. [2022-02-20 19:58:46,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:46,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:46,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:46,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4066 states, 3220 states have (on average 1.2847826086956522) internal successors, (4137), 3278 states have internal predecessors, (4137), 420 states have call successors, (420), 343 states have call predecessors, (420), 424 states have return successors, (592), 449 states have call predecessors, (592), 418 states have call successors, (592) [2022-02-20 19:58:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 5149 transitions. [2022-02-20 19:58:47,281 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 5149 transitions. Word has length 72 [2022-02-20 19:58:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:47,281 INFO L470 AbstractCegarLoop]: Abstraction has 4066 states and 5149 transitions. [2022-02-20 19:58:47,281 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:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 5149 transitions. [2022-02-20 19:58:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:47,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:47,282 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:47,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:47,282 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1580378082, now seen corresponding path program 1 times [2022-02-20 19:58:47,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:47,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241585475] [2022-02-20 19:58:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {87625#(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); {87584#true} is VALID [2022-02-20 19:58:47,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87584#true} {87584#true} #1772#return; {87584#true} is VALID [2022-02-20 19:58:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {87626#(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); {87584#true} is VALID [2022-02-20 19:58:47,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume !(0 == ~q_write_ev~0); {87584#true} is VALID [2022-02-20 19:58:47,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87584#true} {87584#true} #1774#return; {87584#true} is VALID [2022-02-20 19:58:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {87584#true} havoc ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume !(1 == ~p_dw_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} ~__retres1~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {87584#true} #res := ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,353 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {87584#true} {87584#true} #1768#return; {87584#true} is VALID [2022-02-20 19:58:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {87584#true} havoc ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume !(1 == ~c_dr_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} ~__retres1~1 := 0; {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {87584#true} #res := ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {87584#true} {87584#true} #1770#return; {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {87627#(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; {87584#true} is VALID [2022-02-20 19:58:47,357 INFO L272 TraceCheckUtils]: 1: Hoare triple {87584#true} call #t~ret8 := is_do_write_p_triggered(); {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} havoc ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {87584#true} assume !(1 == ~p_dw_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {87584#true} ~__retres1~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {87584#true} #res := ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {87584#true} {87584#true} #1768#return; {87584#true} is VALID [2022-02-20 19:58:47,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {87584#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {87584#true} assume !(0 != ~tmp~1); {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L272 TraceCheckUtils]: 10: Hoare triple {87584#true} call #t~ret9 := is_do_read_c_triggered(); {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {87584#true} havoc ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {87584#true} assume !(1 == ~c_dr_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {87584#true} ~__retres1~1 := 0; {87584#true} is VALID [2022-02-20 19:58:47,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {87584#true} #res := ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87584#true} {87584#true} #1770#return; {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {87584#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {87584#true} assume !(0 != ~tmp___0~1); {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,360 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {87584#true} {87584#true} #1776#return; {87584#true} is VALID [2022-02-20 19:58:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {87626#(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); {87584#true} is VALID [2022-02-20 19:58:47,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume !(1 == ~q_write_ev~0); {87584#true} is VALID [2022-02-20 19:58:47,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87584#true} {87584#true} #1778#return; {87584#true} is VALID [2022-02-20 19:58:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:47,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {87584#true} havoc ~__retres1~2; {87584#true} is VALID [2022-02-20 19:58:47,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87584#true} is VALID [2022-02-20 19:58:47,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} #res := ~__retres1~2; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87584#true} {87584#true} #1780#return; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {87584#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {87584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {87584#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {87584#true} is VALID [2022-02-20 19:58:47,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {87584#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; {87584#true} is VALID [2022-02-20 19:58:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {87584#true} call update_channels1(); {87625#(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:47,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {87625#(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); {87584#true} is VALID [2022-02-20 19:58:47,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,372 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {87584#true} {87584#true} #1772#return; {87584#true} is VALID [2022-02-20 19:58:47,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {87584#true} assume { :begin_inline_init_threads1 } true; {87584#true} is VALID [2022-02-20 19:58:47,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {87584#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {87584#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {87584#true} assume { :end_inline_init_threads1 } true; {87584#true} is VALID [2022-02-20 19:58:47,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {87584#true} call fire_delta_events1(); {87626#(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:47,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {87626#(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); {87584#true} is VALID [2022-02-20 19:58:47,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {87584#true} assume !(0 == ~q_write_ev~0); {87584#true} is VALID [2022-02-20 19:58:47,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87584#true} {87584#true} #1774#return; {87584#true} is VALID [2022-02-20 19:58:47,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {87584#true} call activate_threads1(); {87627#(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:47,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {87627#(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; {87584#true} is VALID [2022-02-20 19:58:47,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {87584#true} call #t~ret8 := is_do_write_p_triggered(); {87584#true} is VALID [2022-02-20 19:58:47,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {87584#true} havoc ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {87584#true} assume !(1 == ~p_dw_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {87584#true} ~__retres1~0 := 0; {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {87584#true} #res := ~__retres1~0; {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {87584#true} {87584#true} #1768#return; {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {87584#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {87584#true} assume !(0 != ~tmp~1); {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {87584#true} call #t~ret9 := is_do_read_c_triggered(); {87584#true} is VALID [2022-02-20 19:58:47,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {87584#true} havoc ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {87584#true} assume !(1 == ~c_dr_pc~0); {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {87584#true} ~__retres1~1 := 0; {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {87584#true} #res := ~__retres1~1; {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {87584#true} {87584#true} #1770#return; {87584#true} is VALID [2022-02-20 19:58:47,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {87584#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {87584#true} is VALID [2022-02-20 19:58:47,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {87584#true} assume !(0 != ~tmp___0~1); {87584#true} is VALID [2022-02-20 19:58:47,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,377 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {87584#true} {87584#true} #1776#return; {87584#true} is VALID [2022-02-20 19:58:47,377 INFO L272 TraceCheckUtils]: 39: Hoare triple {87584#true} call reset_delta_events1(); {87626#(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:47,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {87626#(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); {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {87584#true} assume !(1 == ~q_write_ev~0); {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87584#true} {87584#true} #1778#return; {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {87584#true} assume !false; {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {87584#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; {87584#true} is VALID [2022-02-20 19:58:47,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {87584#true} assume !false; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L272 TraceCheckUtils]: 47: Hoare triple {87584#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {87584#true} havoc ~__retres1~2; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {87584#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {87584#true} #res := ~__retres1~2; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {87584#true} assume true; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {87584#true} {87584#true} #1780#return; {87584#true} is VALID [2022-02-20 19:58:47,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {87584#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; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {87584#true} assume 0 != eval1_~tmp___1~0#1; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {87584#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; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {87584#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; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {87584#true} assume 0 == ~p_dw_pc~0; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {87584#true} assume !false; {87584#true} is VALID [2022-02-20 19:58:47,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {87584#true} assume !(0 == ~q_free~0); {87584#true} is VALID [2022-02-20 19:58:47,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {87584#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; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {87623#(= ~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; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {87623#(= ~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; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {87623#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {87623#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:47,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {87623#(= ~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; {87624#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:47,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {87624#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {87585#false} is VALID [2022-02-20 19:58:47,385 INFO L272 TraceCheckUtils]: 71: Hoare triple {87585#false} call error1(); {87585#false} is VALID [2022-02-20 19:58:47,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {87585#false} assume !false; {87585#false} is VALID [2022-02-20 19:58:47,386 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:47,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:47,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241585475] [2022-02-20 19:58:47,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241585475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:47,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:47,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:47,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493771176] [2022-02-20 19:58:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:47,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:47,388 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:47,430 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:47,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:47,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:47,431 INFO L87 Difference]: Start difference. First operand 4066 states and 5149 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:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,574 INFO L93 Difference]: Finished difference Result 5115 states and 6409 transitions. [2022-02-20 19:58:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:50,574 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:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:50,575 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:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 830 transitions. [2022-02-20 19:58:50,579 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:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 830 transitions. [2022-02-20 19:58:50,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 830 transitions. [2022-02-20 19:58:51,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 830 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:52,214 INFO L225 Difference]: With dead ends: 5115 [2022-02-20 19:58:52,214 INFO L226 Difference]: Without dead ends: 5112 [2022-02-20 19:58:52,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:52,215 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 2279 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2289 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:52,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2289 Valid, 1349 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2022-02-20 19:58:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 4803. [2022-02-20 19:58:52,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:52,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5112 states. Second operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) [2022-02-20 19:58:52,495 INFO L74 IsIncluded]: Start isIncluded. First operand 5112 states. Second operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) [2022-02-20 19:58:52,500 INFO L87 Difference]: Start difference. First operand 5112 states. Second operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) [2022-02-20 19:58:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,204 INFO L93 Difference]: Finished difference Result 5112 states and 6389 transitions. [2022-02-20 19:58:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 6389 transitions. [2022-02-20 19:58:53,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) Second operand 5112 states. [2022-02-20 19:58:53,221 INFO L87 Difference]: Start difference. First operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) Second operand 5112 states. [2022-02-20 19:58:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,966 INFO L93 Difference]: Finished difference Result 5112 states and 6389 transitions. [2022-02-20 19:58:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 6389 transitions. [2022-02-20 19:58:53,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:53,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 3782 states have (on average 1.273664727657324) internal successors, (4817), 3847 states have internal predecessors, (4817), 501 states have call successors, (501), 413 states have call predecessors, (501), 518 states have return successors, (716), 547 states have call predecessors, (716), 500 states have call successors, (716) [2022-02-20 19:58:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 6034 transitions. [2022-02-20 19:58:54,897 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 6034 transitions. Word has length 73 [2022-02-20 19:58:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:54,898 INFO L470 AbstractCegarLoop]: Abstraction has 4803 states and 6034 transitions. [2022-02-20 19:58:54,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 6034 transitions. [2022-02-20 19:58:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:54,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:54,899 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:54,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:54,899 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1748440700, now seen corresponding path program 1 times [2022-02-20 19:58:54,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:54,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021910075] [2022-02-20 19:58:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:54,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {111195#(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); {111153#true} is VALID [2022-02-20 19:58:55,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1772#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {111196#(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); {111153#true} is VALID [2022-02-20 19:58:55,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume !(0 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:55,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1774#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} havoc ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume !(1 == ~p_dw_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} ~__retres1~0 := 0; {111153#true} is VALID [2022-02-20 19:58:55,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {111153#true} #res := ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,031 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111153#true} {111153#true} #1768#return; {111153#true} is VALID [2022-02-20 19:58:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} havoc ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume !(1 == ~c_dr_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} ~__retres1~1 := 0; {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {111153#true} #res := ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {111153#true} {111153#true} #1770#return; {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {111197#(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; {111153#true} is VALID [2022-02-20 19:58:55,034 INFO L272 TraceCheckUtils]: 1: Hoare triple {111153#true} call #t~ret8 := is_do_write_p_triggered(); {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} havoc ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {111153#true} assume !(1 == ~p_dw_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {111153#true} ~__retres1~0 := 0; {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {111153#true} #res := ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111153#true} {111153#true} #1768#return; {111153#true} is VALID [2022-02-20 19:58:55,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {111153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {111153#true} assume !(0 != ~tmp~1); {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L272 TraceCheckUtils]: 10: Hoare triple {111153#true} call #t~ret9 := is_do_read_c_triggered(); {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {111153#true} havoc ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {111153#true} assume !(1 == ~c_dr_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {111153#true} ~__retres1~1 := 0; {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {111153#true} #res := ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111153#true} {111153#true} #1770#return; {111153#true} is VALID [2022-02-20 19:58:55,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {111153#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111153#true} is VALID [2022-02-20 19:58:55,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {111153#true} assume !(0 != ~tmp___0~1); {111153#true} is VALID [2022-02-20 19:58:55,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,037 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1776#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {111196#(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); {111153#true} is VALID [2022-02-20 19:58:55,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume !(1 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:55,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1778#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} havoc ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:55,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111153#true} is VALID [2022-02-20 19:58:55,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} #res := ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:55,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,046 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1780#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {111153#true} is VALID [2022-02-20 19:58:55,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {111153#true} is VALID [2022-02-20 19:58:55,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111195#(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:55,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {111195#(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); {111153#true} is VALID [2022-02-20 19:58:55,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,049 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1772#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,051 INFO L272 TraceCheckUtils]: 12: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111196#(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:55,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {111196#(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); {111153#true} is VALID [2022-02-20 19:58:55,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {111153#true} assume !(0 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:55,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,051 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1774#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111197#(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:55,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {111197#(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; {111153#true} is VALID [2022-02-20 19:58:55,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {111153#true} call #t~ret8 := is_do_write_p_triggered(); {111153#true} is VALID [2022-02-20 19:58:55,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {111153#true} havoc ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {111153#true} assume !(1 == ~p_dw_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {111153#true} ~__retres1~0 := 0; {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {111153#true} #res := ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111153#true} {111153#true} #1768#return; {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {111153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {111153#true} assume !(0 != ~tmp~1); {111153#true} is VALID [2022-02-20 19:58:55,053 INFO L272 TraceCheckUtils]: 28: Hoare triple {111153#true} call #t~ret9 := is_do_read_c_triggered(); {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {111153#true} havoc ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {111153#true} assume !(1 == ~c_dr_pc~0); {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {111153#true} ~__retres1~1 := 0; {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {111153#true} #res := ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111153#true} {111153#true} #1770#return; {111153#true} is VALID [2022-02-20 19:58:55,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {111153#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111153#true} is VALID [2022-02-20 19:58:55,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {111153#true} assume !(0 != ~tmp___0~1); {111153#true} is VALID [2022-02-20 19:58:55,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,055 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1776#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,056 INFO L272 TraceCheckUtils]: 39: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111196#(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:55,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {111196#(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); {111153#true} is VALID [2022-02-20 19:58:55,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {111153#true} assume !(1 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:55,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,056 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1778#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,058 INFO L272 TraceCheckUtils]: 47: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111153#true} is VALID [2022-02-20 19:58:55,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {111153#true} havoc ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:55,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {111153#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111153#true} is VALID [2022-02-20 19:58:55,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {111153#true} #res := ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:55,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:55,059 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111153#true} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1780#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {111155#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,065 INFO L290 TraceCheckUtils]: 67: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {111193#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:55,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:55,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {111194#(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); {111154#false} is VALID [2022-02-20 19:58:55,067 INFO L272 TraceCheckUtils]: 72: Hoare triple {111154#false} call error1(); {111154#false} is VALID [2022-02-20 19:58:55,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {111154#false} assume !false; {111154#false} is VALID [2022-02-20 19:58:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:55,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:55,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021910075] [2022-02-20 19:58:55,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021910075] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:55,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853943772] [2022-02-20 19:58:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:55,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:58:55,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:58:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:55,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {111153#true} is VALID [2022-02-20 19:58:55,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {111153#true} is VALID [2022-02-20 19:58:55,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,802 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1772#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,803 INFO L272 TraceCheckUtils]: 12: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,805 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1774#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,805 INFO L272 TraceCheckUtils]: 17: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,808 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1768#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,809 INFO L272 TraceCheckUtils]: 28: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,812 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1770#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,813 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1776#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,813 INFO L272 TraceCheckUtils]: 39: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,815 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1778#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,816 INFO L272 TraceCheckUtils]: 47: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,818 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1780#return; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {111155#(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; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {111155#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:55,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {111155#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {111193#(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; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {111193#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {111193#(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; {111420#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {111420#(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; {111420#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:55,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {111420#(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); {111154#false} is VALID [2022-02-20 19:58:55,825 INFO L272 TraceCheckUtils]: 72: Hoare triple {111154#false} call error1(); {111154#false} is VALID [2022-02-20 19:58:55,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {111154#false} assume !false; {111154#false} is VALID [2022-02-20 19:58:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:55,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:56,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {111154#false} assume !false; {111154#false} is VALID [2022-02-20 19:58:56,260 INFO L272 TraceCheckUtils]: 72: Hoare triple {111154#false} call error1(); {111154#false} is VALID [2022-02-20 19:58:56,260 INFO L290 TraceCheckUtils]: 71: Hoare triple {111194#(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); {111154#false} is VALID [2022-02-20 19:58:56,261 INFO L290 TraceCheckUtils]: 70: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,261 INFO L290 TraceCheckUtils]: 69: Hoare triple {111445#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {111445#(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; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {111445#(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; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {111445#(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; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {111445#(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; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {111194#(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; {111445#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:56,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,268 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {111153#true} {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1780#return; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {111153#true} #res := ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:56,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {111153#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {111153#true} is VALID [2022-02-20 19:58:56,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {111153#true} havoc ~__retres1~2; {111153#true} is VALID [2022-02-20 19:58:56,269 INFO L272 TraceCheckUtils]: 47: Hoare triple {111194#(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(); {111153#true} is VALID [2022-02-20 19:58:56,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,271 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {111153#true} {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1778#return; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {111153#true} assume !(1 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:56,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {111153#true} assume !(1 == ~q_read_ev~0); {111153#true} is VALID [2022-02-20 19:58:56,272 INFO L272 TraceCheckUtils]: 39: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {111153#true} is VALID [2022-02-20 19:58:56,272 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {111153#true} {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1776#return; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {111153#true} assume !(0 != ~tmp___0~1); {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {111153#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {111153#true} {111153#true} #1770#return; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {111153#true} #res := ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {111153#true} ~__retres1~1 := 0; {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {111153#true} assume !(1 == ~c_dr_pc~0); {111153#true} is VALID [2022-02-20 19:58:56,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {111153#true} havoc ~__retres1~1; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L272 TraceCheckUtils]: 28: Hoare triple {111153#true} call #t~ret9 := is_do_read_c_triggered(); {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {111153#true} assume !(0 != ~tmp~1); {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {111153#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111153#true} {111153#true} #1768#return; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {111153#true} #res := ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {111153#true} ~__retres1~0 := 0; {111153#true} is VALID [2022-02-20 19:58:56,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {111153#true} assume !(1 == ~p_dw_pc~0); {111153#true} is VALID [2022-02-20 19:58:56,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {111153#true} havoc ~__retres1~0; {111153#true} is VALID [2022-02-20 19:58:56,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {111153#true} call #t~ret8 := is_do_write_p_triggered(); {111153#true} is VALID [2022-02-20 19:58:56,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {111153#true} havoc ~tmp~1;havoc ~tmp___0~1; {111153#true} is VALID [2022-02-20 19:58:56,275 INFO L272 TraceCheckUtils]: 17: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {111153#true} is VALID [2022-02-20 19:58:56,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {111153#true} {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1774#return; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {111153#true} assume !(0 == ~q_write_ev~0); {111153#true} is VALID [2022-02-20 19:58:56,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {111153#true} assume !(0 == ~q_read_ev~0); {111153#true} is VALID [2022-02-20 19:58:56,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {111153#true} is VALID [2022-02-20 19:58:56,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,279 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {111153#true} {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1772#return; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {111153#true} assume true; {111153#true} is VALID [2022-02-20 19:58:56,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {111153#true} assume !(1 == ~q_req_up~0); {111153#true} is VALID [2022-02-20 19:58:56,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {111153#true} is VALID [2022-02-20 19:58:56,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {111194#(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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {111153#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {111194#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:56,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {111153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {111153#true} is VALID [2022-02-20 19:58:56,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {111153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {111153#true} is VALID [2022-02-20 19:58:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:56,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853943772] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:56,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:56,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:56,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408381183] [2022-02-20 19:58:56,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:56,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:56,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:56,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:56,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:56,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:56,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:56,375 INFO L87 Difference]: Start difference. First operand 4803 states and 6034 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)