./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.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.09.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 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:41,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:41,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:41,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:41,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:41,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:41,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:41,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:41,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:41,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:41,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:41,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:41,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:41,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:41,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:41,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:41,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:41,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:41,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:41,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:41,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:41,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:41,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:41,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:41,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:41,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:41,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:41,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:41,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:41,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:41,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:41,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:41,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:41,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:41,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:41,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:41,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:41,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:41,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:41,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:41,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:41,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:57:41,849 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:41,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:41,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:41,850 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:41,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:41,851 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:41,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:41,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:41,852 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:41,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:41,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:41,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:41,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:41,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:41,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:41,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:41,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:41,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:41,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:41,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:41,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:41,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:41,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:41,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:41,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:41,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:41,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:41,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:41,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:41,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:41,857 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:41,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:41,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:41,858 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 -> 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b [2022-02-20 19:57:42,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:42,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:42,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:42,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:42,080 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:42,081 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.09.cil-2.c [2022-02-20 19:57:42,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8025adf/e409e72f32d4479b9f0c16cdfcc33851/FLAGb899cbb90 [2022-02-20 19:57:42,534 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:42,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2022-02-20 19:57:42,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8025adf/e409e72f32d4479b9f0c16cdfcc33851/FLAGb899cbb90 [2022-02-20 19:57:42,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8025adf/e409e72f32d4479b9f0c16cdfcc33851 [2022-02-20 19:57:42,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:42,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:42,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:42,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:42,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:42,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:42" (1/1) ... [2022-02-20 19:57:42,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee672a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:42, skipping insertion in model container [2022-02-20 19:57:42,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:42" (1/1) ... [2022-02-20 19:57:42,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:42,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:42,769 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.09.cil-2.c[914,927] [2022-02-20 19:57:42,841 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.09.cil-2.c[7115,7128] [2022-02-20 19:57:42,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:42,954 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:42,964 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.09.cil-2.c[914,927] [2022-02-20 19:57:42,980 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.09.cil-2.c[7115,7128] [2022-02-20 19:57:43,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:43,105 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:43,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43 WrapperNode [2022-02-20 19:57:43,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:43,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:43,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:43,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:43,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,191 INFO L137 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 871 [2022-02-20 19:57:43,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:43,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:43,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:43,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:43,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:43,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:43,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:43,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:43,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (1/1) ... [2022-02-20 19:57:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:43,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:57:43,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:57:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:43,311 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:43,449 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:43,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:44,177 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:44,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:44,190 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 19:57:44,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:44 BoogieIcfgContainer [2022-02-20 19:57:44,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:44,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:44,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:44,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:44,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:42" (1/3) ... [2022-02-20 19:57:44,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:44, skipping insertion in model container [2022-02-20 19:57:44,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:43" (2/3) ... [2022-02-20 19:57:44,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:44, skipping insertion in model container [2022-02-20 19:57:44,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:44" (3/3) ... [2022-02-20 19:57:44,200 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2022-02-20 19:57:44,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:44,205 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:44,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:44,265 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:57:44,266 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 416 states, 359 states have (on average 1.6323119777158774) internal successors, (586), 367 states have internal predecessors, (586), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 19:57:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:44,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:44,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:44,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 910047860, now seen corresponding path program 1 times [2022-02-20 19:57:44,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:44,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704984666] [2022-02-20 19:57:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#(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); {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {421#(= ~q_read_ev~0 2)} #1577#return; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#(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; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#(= |old(~q_read_ev~0)| 0)} assume true; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#(= |old(~q_read_ev~0)| 0)} {421#(= ~q_read_ev~0 2)} #1579#return; {420#false} is VALID [2022-02-20 19:57:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#true} havoc ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume 1 == ~p_dw_pc~0; {419#true} is VALID [2022-02-20 19:57:44,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {419#true} is VALID [2022-02-20 19:57:44,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} #res := ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,771 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {419#true} {419#true} #1573#return; {419#true} is VALID [2022-02-20 19:57:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#true} havoc ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(1 == ~c_dr_pc~0); {419#true} is VALID [2022-02-20 19:57:44,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} ~__retres1~1 := 0; {419#true} is VALID [2022-02-20 19:57:44,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} #res := ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,778 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {419#true} {419#true} #1575#return; {419#true} is VALID [2022-02-20 19:57:44,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#(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; {419#true} is VALID [2022-02-20 19:57:44,778 INFO L272 TraceCheckUtils]: 1: Hoare triple {419#true} call #t~ret8 := is_do_write_p_triggered(); {419#true} is VALID [2022-02-20 19:57:44,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} havoc ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} assume 1 == ~p_dw_pc~0; {419#true} is VALID [2022-02-20 19:57:44,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {419#true} is VALID [2022-02-20 19:57:44,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#true} #res := ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,780 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {419#true} {419#true} #1573#return; {419#true} is VALID [2022-02-20 19:57:44,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {419#true} is VALID [2022-02-20 19:57:44,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {419#true} is VALID [2022-02-20 19:57:44,781 INFO L272 TraceCheckUtils]: 10: Hoare triple {419#true} call #t~ret9 := is_do_read_c_triggered(); {419#true} is VALID [2022-02-20 19:57:44,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#true} havoc ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#true} assume !(1 == ~c_dr_pc~0); {419#true} is VALID [2022-02-20 19:57:44,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#true} ~__retres1~1 := 0; {419#true} is VALID [2022-02-20 19:57:44,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#true} #res := ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,782 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {419#true} {419#true} #1575#return; {419#true} is VALID [2022-02-20 19:57:44,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {419#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {419#true} is VALID [2022-02-20 19:57:44,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {419#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {419#true} is VALID [2022-02-20 19:57:44,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,783 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {419#true} {420#false} #1581#return; {420#false} is VALID [2022-02-20 19:57:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#(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; {419#true} is VALID [2022-02-20 19:57:44,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {419#true} is VALID [2022-02-20 19:57:44,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {419#true} {420#false} #1583#return; {420#false} is VALID [2022-02-20 19:57:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#true} havoc ~__retres1~2; {419#true} is VALID [2022-02-20 19:57:44,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {419#true} is VALID [2022-02-20 19:57:44,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} #res := ~__retres1~2; {419#true} is VALID [2022-02-20 19:57:44,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,808 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {419#true} {420#false} #1585#return; {420#false} is VALID [2022-02-20 19:57:44,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {419#true} is VALID [2022-02-20 19:57:44,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {419#true} is VALID [2022-02-20 19:57:44,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {421#(= ~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; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(= ~q_read_ev~0 2)} call update_channels1(); {459#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:44,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#(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); {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,816 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {460#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {421#(= ~q_read_ev~0 2)} #1577#return; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {421#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {421#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,819 INFO L272 TraceCheckUtils]: 12: Hoare triple {421#(= ~q_read_ev~0 2)} call fire_delta_events1(); {461#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:44,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {461#(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; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#(= |old(~q_read_ev~0)| 0)} assume true; {462#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {462#(= |old(~q_read_ev~0)| 0)} {421#(= ~q_read_ev~0 2)} #1579#return; {420#false} is VALID [2022-02-20 19:57:44,821 INFO L272 TraceCheckUtils]: 17: Hoare triple {420#false} call activate_threads1(); {463#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:44,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {463#(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; {419#true} is VALID [2022-02-20 19:57:44,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {419#true} call #t~ret8 := is_do_write_p_triggered(); {419#true} is VALID [2022-02-20 19:57:44,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {419#true} havoc ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {419#true} assume 1 == ~p_dw_pc~0; {419#true} is VALID [2022-02-20 19:57:44,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {419#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {419#true} is VALID [2022-02-20 19:57:44,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {419#true} #res := ~__retres1~0; {419#true} is VALID [2022-02-20 19:57:44,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,824 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {419#true} {419#true} #1573#return; {419#true} is VALID [2022-02-20 19:57:44,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {419#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {419#true} is VALID [2022-02-20 19:57:44,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {419#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {419#true} is VALID [2022-02-20 19:57:44,825 INFO L272 TraceCheckUtils]: 28: Hoare triple {419#true} call #t~ret9 := is_do_read_c_triggered(); {419#true} is VALID [2022-02-20 19:57:44,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {419#true} havoc ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#true} assume !(1 == ~c_dr_pc~0); {419#true} is VALID [2022-02-20 19:57:44,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {419#true} ~__retres1~1 := 0; {419#true} is VALID [2022-02-20 19:57:44,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {419#true} #res := ~__retres1~1; {419#true} is VALID [2022-02-20 19:57:44,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,826 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {419#true} {419#true} #1575#return; {419#true} is VALID [2022-02-20 19:57:44,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {419#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {419#true} is VALID [2022-02-20 19:57:44,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {419#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {419#true} is VALID [2022-02-20 19:57:44,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,827 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {419#true} {420#false} #1581#return; {420#false} is VALID [2022-02-20 19:57:44,828 INFO L272 TraceCheckUtils]: 39: Hoare triple {420#false} call reset_delta_events1(); {461#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:44,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {461#(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; {419#true} is VALID [2022-02-20 19:57:44,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {419#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {419#true} is VALID [2022-02-20 19:57:44,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,829 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {419#true} {420#false} #1583#return; {420#false} is VALID [2022-02-20 19:57:44,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 19:57:44,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {420#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; {420#false} is VALID [2022-02-20 19:57:44,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 19:57:44,830 INFO L272 TraceCheckUtils]: 47: Hoare triple {420#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {419#true} is VALID [2022-02-20 19:57:44,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {419#true} havoc ~__retres1~2; {419#true} is VALID [2022-02-20 19:57:44,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {419#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {419#true} is VALID [2022-02-20 19:57:44,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {419#true} #res := ~__retres1~2; {419#true} is VALID [2022-02-20 19:57:44,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {419#true} assume true; {419#true} is VALID [2022-02-20 19:57:44,833 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {419#true} {420#false} #1585#return; {420#false} is VALID [2022-02-20 19:57:44,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {420#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; {420#false} is VALID [2022-02-20 19:57:44,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {420#false} assume 0 != eval1_~tmp___1~0#1; {420#false} is VALID [2022-02-20 19:57:44,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {420#false} assume !(0 == ~p_dw_st~0); {420#false} is VALID [2022-02-20 19:57:44,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {420#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; {420#false} is VALID [2022-02-20 19:57:44,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {420#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; {420#false} is VALID [2022-02-20 19:57:44,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {420#false} assume 0 == ~c_dr_pc~0; {420#false} is VALID [2022-02-20 19:57:44,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 19:57:44,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {420#false} assume !(1 == ~q_free~0); {420#false} is VALID [2022-02-20 19:57:44,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {420#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; {420#false} is VALID [2022-02-20 19:57:44,843 INFO L290 TraceCheckUtils]: 62: Hoare triple {420#false} assume !(~p_last_write~0 == ~c_last_read~0); {420#false} is VALID [2022-02-20 19:57:44,844 INFO L272 TraceCheckUtils]: 63: Hoare triple {420#false} call error1(); {420#false} is VALID [2022-02-20 19:57:44,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 19:57:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:44,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:44,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704984666] [2022-02-20 19:57:44,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704984666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:44,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:44,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:44,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509605923] [2022-02-20 19:57:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:44,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:44,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:44,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:44,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:44,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:44,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:44,957 INFO L87 Difference]: Start difference. First operand has 416 states, 359 states have (on average 1.6323119777158774) internal successors, (586), 367 states have internal predecessors, (586), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 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:57:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,473 INFO L93 Difference]: Finished difference Result 941 states and 1492 transitions. [2022-02-20 19:57:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1492 transitions. [2022-02-20 19:57:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1492 transitions. [2022-02-20 19:57:48,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1492 transitions. [2022-02-20 19:57:49,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1492 edges. 1492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:49,746 INFO L225 Difference]: With dead ends: 941 [2022-02-20 19:57:49,747 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 19:57:49,752 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:57:49,754 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 1316 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:49,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1321 Valid, 1812 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 19:57:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 501. [2022-02-20 19:57:49,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:49,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:49,829 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:49,831 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:49,864 INFO L93 Difference]: Finished difference Result 540 states and 802 transitions. [2022-02-20 19:57:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 802 transitions. [2022-02-20 19:57:49,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:49,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:49,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 540 states. [2022-02-20 19:57:49,873 INFO L87 Difference]: Start difference. First operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 540 states. [2022-02-20 19:57:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:49,901 INFO L93 Difference]: Finished difference Result 540 states and 802 transitions. [2022-02-20 19:57:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 802 transitions. [2022-02-20 19:57:49,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:49,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:49,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:49,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 427 states have (on average 1.515222482435597) internal successors, (647), 434 states have internal predecessors, (647), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 748 transitions. [2022-02-20 19:57:49,936 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 748 transitions. Word has length 65 [2022-02-20 19:57:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:49,937 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 748 transitions. [2022-02-20 19:57:49,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 748 transitions. [2022-02-20 19:57:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:49,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:49,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:49,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:49,940 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1313833811, now seen corresponding path program 1 times [2022-02-20 19:57:49,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:49,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539349709] [2022-02-20 19:57:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {3531#(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); {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3493#(= ~q_write_ev~0 ~q_read_ev~0)} #1577#return; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {3532#(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); {3533#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {3533#(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; {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3493#(= ~q_write_ev~0 ~q_read_ev~0)} #1579#return; {3492#false} is VALID [2022-02-20 19:57:50,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {3491#true} havoc ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} assume !(1 == ~p_dw_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} ~__retres1~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {3491#true} #res := ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,097 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3491#true} {3491#true} #1573#return; {3491#true} is VALID [2022-02-20 19:57:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {3491#true} havoc ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} assume !(1 == ~c_dr_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} ~__retres1~1 := 0; {3491#true} is VALID [2022-02-20 19:57:50,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {3491#true} #res := ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,103 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3491#true} {3491#true} #1575#return; {3491#true} is VALID [2022-02-20 19:57:50,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {3535#(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; {3491#true} is VALID [2022-02-20 19:57:50,104 INFO L272 TraceCheckUtils]: 1: Hoare triple {3491#true} call #t~ret8 := is_do_write_p_triggered(); {3491#true} is VALID [2022-02-20 19:57:50,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} havoc ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {3491#true} assume !(1 == ~p_dw_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {3491#true} ~__retres1~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {3491#true} #res := ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,105 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3491#true} {3491#true} #1573#return; {3491#true} is VALID [2022-02-20 19:57:50,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {3491#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3491#true} is VALID [2022-02-20 19:57:50,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,105 INFO L272 TraceCheckUtils]: 10: Hoare triple {3491#true} call #t~ret9 := is_do_read_c_triggered(); {3491#true} is VALID [2022-02-20 19:57:50,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#true} havoc ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {3491#true} assume !(1 == ~c_dr_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {3491#true} ~__retres1~1 := 0; {3491#true} is VALID [2022-02-20 19:57:50,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {3491#true} #res := ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,107 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3491#true} {3491#true} #1575#return; {3491#true} is VALID [2022-02-20 19:57:50,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {3491#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3491#true} is VALID [2022-02-20 19:57:50,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {3491#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,107 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3491#true} {3492#false} #1581#return; {3492#false} is VALID [2022-02-20 19:57:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {3532#(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); {3491#true} is VALID [2022-02-20 19:57:50,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3491#true} is VALID [2022-02-20 19:57:50,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3491#true} {3492#false} #1583#return; {3492#false} is VALID [2022-02-20 19:57:50,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {3491#true} havoc ~__retres1~2; {3491#true} is VALID [2022-02-20 19:57:50,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3491#true} is VALID [2022-02-20 19:57:50,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} #res := ~__retres1~2; {3491#true} is VALID [2022-02-20 19:57:50,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,126 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3491#true} {3492#false} #1585#return; {3492#false} is VALID [2022-02-20 19:57:50,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {3491#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {3491#true} is VALID [2022-02-20 19:57:50,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {3493#(= ~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; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3531#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:50,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {3531#(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); {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,130 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3493#(= ~q_write_ev~0 ~q_read_ev~0)} #1577#return; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3493#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,133 INFO L272 TraceCheckUtils]: 12: Hoare triple {3493#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {3532#(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); {3533#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {3533#(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; {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:50,135 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3534#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3493#(= ~q_write_ev~0 ~q_read_ev~0)} #1579#return; {3492#false} is VALID [2022-02-20 19:57:50,135 INFO L272 TraceCheckUtils]: 17: Hoare triple {3492#false} call activate_threads1(); {3535#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:50,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {3535#(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; {3491#true} is VALID [2022-02-20 19:57:50,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {3491#true} call #t~ret8 := is_do_write_p_triggered(); {3491#true} is VALID [2022-02-20 19:57:50,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {3491#true} havoc ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {3491#true} assume !(1 == ~p_dw_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {3491#true} ~__retres1~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {3491#true} #res := ~__retres1~0; {3491#true} is VALID [2022-02-20 19:57:50,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,137 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3491#true} {3491#true} #1573#return; {3491#true} is VALID [2022-02-20 19:57:50,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {3491#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3491#true} is VALID [2022-02-20 19:57:50,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {3491#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,137 INFO L272 TraceCheckUtils]: 28: Hoare triple {3491#true} call #t~ret9 := is_do_read_c_triggered(); {3491#true} is VALID [2022-02-20 19:57:50,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {3491#true} havoc ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {3491#true} assume !(1 == ~c_dr_pc~0); {3491#true} is VALID [2022-02-20 19:57:50,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {3491#true} ~__retres1~1 := 0; {3491#true} is VALID [2022-02-20 19:57:50,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {3491#true} #res := ~__retres1~1; {3491#true} is VALID [2022-02-20 19:57:50,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,141 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3491#true} {3491#true} #1575#return; {3491#true} is VALID [2022-02-20 19:57:50,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {3491#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3491#true} is VALID [2022-02-20 19:57:50,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {3491#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3491#true} is VALID [2022-02-20 19:57:50,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,142 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3491#true} {3492#false} #1581#return; {3492#false} is VALID [2022-02-20 19:57:50,143 INFO L272 TraceCheckUtils]: 39: Hoare triple {3492#false} call reset_delta_events1(); {3532#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:50,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {3532#(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); {3491#true} is VALID [2022-02-20 19:57:50,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {3491#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3491#true} is VALID [2022-02-20 19:57:50,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,149 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3491#true} {3492#false} #1583#return; {3492#false} is VALID [2022-02-20 19:57:50,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {3492#false} assume !false; {3492#false} is VALID [2022-02-20 19:57:50,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {3492#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; {3492#false} is VALID [2022-02-20 19:57:50,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {3492#false} assume !false; {3492#false} is VALID [2022-02-20 19:57:50,149 INFO L272 TraceCheckUtils]: 47: Hoare triple {3492#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3491#true} is VALID [2022-02-20 19:57:50,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {3491#true} havoc ~__retres1~2; {3491#true} is VALID [2022-02-20 19:57:50,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {3491#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3491#true} is VALID [2022-02-20 19:57:50,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {3491#true} #res := ~__retres1~2; {3491#true} is VALID [2022-02-20 19:57:50,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {3491#true} assume true; {3491#true} is VALID [2022-02-20 19:57:50,152 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3491#true} {3492#false} #1585#return; {3492#false} is VALID [2022-02-20 19:57:50,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {3492#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; {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {3492#false} assume 0 != eval1_~tmp___1~0#1; {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {3492#false} assume !(0 == ~p_dw_st~0); {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {3492#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; {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {3492#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; {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {3492#false} assume 0 == ~c_dr_pc~0; {3492#false} is VALID [2022-02-20 19:57:50,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {3492#false} assume !false; {3492#false} is VALID [2022-02-20 19:57:50,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {3492#false} assume !(1 == ~q_free~0); {3492#false} is VALID [2022-02-20 19:57:50,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {3492#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; {3492#false} is VALID [2022-02-20 19:57:50,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {3492#false} assume !(~p_last_write~0 == ~c_last_read~0); {3492#false} is VALID [2022-02-20 19:57:50,154 INFO L272 TraceCheckUtils]: 63: Hoare triple {3492#false} call error1(); {3492#false} is VALID [2022-02-20 19:57:50,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {3492#false} assume !false; {3492#false} is VALID [2022-02-20 19:57:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:50,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:50,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539349709] [2022-02-20 19:57:50,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539349709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:50,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:50,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:50,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423933960] [2022-02-20 19:57:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:50,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:50,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:50,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:50,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:50,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:50,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:50,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:50,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:50,211 INFO L87 Difference]: Start difference. First operand 501 states and 748 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,086 INFO L93 Difference]: Finished difference Result 848 states and 1225 transitions. [2022-02-20 19:57:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 954 transitions. [2022-02-20 19:57:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 954 transitions. [2022-02-20 19:57:54,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 954 transitions. [2022-02-20 19:57:54,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 954 edges. 954 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:54,848 INFO L225 Difference]: With dead ends: 848 [2022-02-20 19:57:54,848 INFO L226 Difference]: Without dead ends: 671 [2022-02-20 19:57:54,849 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:57:54,850 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 1209 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:54,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 2349 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 19:57:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-02-20 19:57:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 597. [2022-02-20 19:57:54,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:54,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:54,885 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:54,887 INFO L87 Difference]: Start difference. First operand 671 states. Second operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,917 INFO L93 Difference]: Finished difference Result 671 states and 985 transitions. [2022-02-20 19:57:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 985 transitions. [2022-02-20 19:57:54,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 671 states. [2022-02-20 19:57:54,924 INFO L87 Difference]: Start difference. First operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 671 states. [2022-02-20 19:57:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,956 INFO L93 Difference]: Finished difference Result 671 states and 985 transitions. [2022-02-20 19:57:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 985 transitions. [2022-02-20 19:57:54,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:54,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 503 states have (on average 1.4930417495029822) internal successors, (751), 512 states have internal predecessors, (751), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 882 transitions. [2022-02-20 19:57:54,989 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 882 transitions. Word has length 65 [2022-02-20 19:57:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:54,989 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 882 transitions. [2022-02-20 19:57:54,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 882 transitions. [2022-02-20 19:57:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:54,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:54,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:54,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:55,004 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -714752299, now seen corresponding path program 1 times [2022-02-20 19:57:55,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:55,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680031160] [2022-02-20 19:57:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {6885#(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); {6846#true} is VALID [2022-02-20 19:57:55,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6846#true} {6846#true} #1577#return; {6846#true} is VALID [2022-02-20 19:57:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {6886#(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); {6846#true} is VALID [2022-02-20 19:57:55,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume !(0 == ~q_write_ev~0); {6846#true} is VALID [2022-02-20 19:57:55,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6846#true} {6846#true} #1579#return; {6846#true} is VALID [2022-02-20 19:57:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {6846#true} havoc ~__retres1~0; {6846#true} is VALID [2022-02-20 19:57:55,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume !(1 == ~p_dw_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} ~__retres1~0 := 0; {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:55,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,157 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6846#true} #1573#return; {6894#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {6846#true} havoc ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume !(1 == ~c_dr_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} ~__retres1~1 := 0; {6846#true} is VALID [2022-02-20 19:57:55,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {6846#true} #res := ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,163 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6846#true} {6847#false} #1575#return; {6847#false} is VALID [2022-02-20 19:57:55,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {6887#(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; {6846#true} is VALID [2022-02-20 19:57:55,163 INFO L272 TraceCheckUtils]: 1: Hoare triple {6846#true} call #t~ret8 := is_do_write_p_triggered(); {6846#true} is VALID [2022-02-20 19:57:55,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} havoc ~__retres1~0; {6846#true} is VALID [2022-02-20 19:57:55,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {6846#true} assume !(1 == ~p_dw_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {6846#true} ~__retres1~0 := 0; {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:55,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6846#true} #1573#return; {6894#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:55,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {6894#(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; {6895#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:55,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {6895#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6847#false} is VALID [2022-02-20 19:57:55,167 INFO L272 TraceCheckUtils]: 10: Hoare triple {6847#false} call #t~ret9 := is_do_read_c_triggered(); {6846#true} is VALID [2022-02-20 19:57:55,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {6846#true} havoc ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {6846#true} assume !(1 == ~c_dr_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {6846#true} ~__retres1~1 := 0; {6846#true} is VALID [2022-02-20 19:57:55,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {6846#true} #res := ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6846#true} {6847#false} #1575#return; {6847#false} is VALID [2022-02-20 19:57:55,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {6847#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6847#false} is VALID [2022-02-20 19:57:55,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {6847#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6847#false} is VALID [2022-02-20 19:57:55,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {6847#false} assume true; {6847#false} is VALID [2022-02-20 19:57:55,169 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6847#false} {6846#true} #1581#return; {6847#false} is VALID [2022-02-20 19:57:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {6886#(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); {6846#true} is VALID [2022-02-20 19:57:55,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6846#true} is VALID [2022-02-20 19:57:55,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6846#true} {6847#false} #1583#return; {6847#false} is VALID [2022-02-20 19:57:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {6846#true} havoc ~__retres1~2; {6846#true} is VALID [2022-02-20 19:57:55,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6846#true} is VALID [2022-02-20 19:57:55,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} #res := ~__retres1~2; {6846#true} is VALID [2022-02-20 19:57:55,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,179 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6846#true} {6847#false} #1585#return; {6847#false} is VALID [2022-02-20 19:57:55,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {6846#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {6846#true} is VALID [2022-02-20 19:57:55,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {6846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {6846#true} is VALID [2022-02-20 19:57:55,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {6846#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {6846#true} is VALID [2022-02-20 19:57:55,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {6846#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; {6846#true} is VALID [2022-02-20 19:57:55,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {6846#true} call update_channels1(); {6885#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:55,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#(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); {6846#true} is VALID [2022-02-20 19:57:55,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,181 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6846#true} {6846#true} #1577#return; {6846#true} is VALID [2022-02-20 19:57:55,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {6846#true} assume { :begin_inline_init_threads1 } true; {6846#true} is VALID [2022-02-20 19:57:55,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {6846#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6846#true} is VALID [2022-02-20 19:57:55,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {6846#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6846#true} is VALID [2022-02-20 19:57:55,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {6846#true} assume { :end_inline_init_threads1 } true; {6846#true} is VALID [2022-02-20 19:57:55,182 INFO L272 TraceCheckUtils]: 12: Hoare triple {6846#true} call fire_delta_events1(); {6886#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:55,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {6886#(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); {6846#true} is VALID [2022-02-20 19:57:55,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {6846#true} assume !(0 == ~q_write_ev~0); {6846#true} is VALID [2022-02-20 19:57:55,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,183 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6846#true} {6846#true} #1579#return; {6846#true} is VALID [2022-02-20 19:57:55,184 INFO L272 TraceCheckUtils]: 17: Hoare triple {6846#true} call activate_threads1(); {6887#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:55,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {6887#(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; {6846#true} is VALID [2022-02-20 19:57:55,184 INFO L272 TraceCheckUtils]: 19: Hoare triple {6846#true} call #t~ret8 := is_do_write_p_triggered(); {6846#true} is VALID [2022-02-20 19:57:55,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {6846#true} havoc ~__retres1~0; {6846#true} is VALID [2022-02-20 19:57:55,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {6846#true} assume !(1 == ~p_dw_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {6846#true} ~__retres1~0 := 0; {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:55,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {6902#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:55,186 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6903#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6846#true} #1573#return; {6894#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:55,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {6894#(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; {6895#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:55,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {6895#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6847#false} is VALID [2022-02-20 19:57:55,188 INFO L272 TraceCheckUtils]: 28: Hoare triple {6847#false} call #t~ret9 := is_do_read_c_triggered(); {6846#true} is VALID [2022-02-20 19:57:55,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {6846#true} havoc ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {6846#true} assume !(1 == ~c_dr_pc~0); {6846#true} is VALID [2022-02-20 19:57:55,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {6846#true} ~__retres1~1 := 0; {6846#true} is VALID [2022-02-20 19:57:55,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {6846#true} #res := ~__retres1~1; {6846#true} is VALID [2022-02-20 19:57:55,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,189 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6846#true} {6847#false} #1575#return; {6847#false} is VALID [2022-02-20 19:57:55,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {6847#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6847#false} is VALID [2022-02-20 19:57:55,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {6847#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6847#false} is VALID [2022-02-20 19:57:55,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {6847#false} assume true; {6847#false} is VALID [2022-02-20 19:57:55,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6847#false} {6846#true} #1581#return; {6847#false} is VALID [2022-02-20 19:57:55,189 INFO L272 TraceCheckUtils]: 39: Hoare triple {6847#false} call reset_delta_events1(); {6886#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:55,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {6886#(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); {6846#true} is VALID [2022-02-20 19:57:55,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {6846#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6846#true} is VALID [2022-02-20 19:57:55,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,190 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6846#true} {6847#false} #1583#return; {6847#false} is VALID [2022-02-20 19:57:55,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {6847#false} assume !false; {6847#false} is VALID [2022-02-20 19:57:55,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {6847#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; {6847#false} is VALID [2022-02-20 19:57:55,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {6847#false} assume !false; {6847#false} is VALID [2022-02-20 19:57:55,191 INFO L272 TraceCheckUtils]: 47: Hoare triple {6847#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6846#true} is VALID [2022-02-20 19:57:55,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {6846#true} havoc ~__retres1~2; {6846#true} is VALID [2022-02-20 19:57:55,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {6846#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6846#true} is VALID [2022-02-20 19:57:55,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {6846#true} #res := ~__retres1~2; {6846#true} is VALID [2022-02-20 19:57:55,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {6846#true} assume true; {6846#true} is VALID [2022-02-20 19:57:55,192 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6846#true} {6847#false} #1585#return; {6847#false} is VALID [2022-02-20 19:57:55,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {6847#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; {6847#false} is VALID [2022-02-20 19:57:55,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {6847#false} assume 0 != eval1_~tmp___1~0#1; {6847#false} is VALID [2022-02-20 19:57:55,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {6847#false} assume !(0 == ~p_dw_st~0); {6847#false} is VALID [2022-02-20 19:57:55,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {6847#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; {6847#false} is VALID [2022-02-20 19:57:55,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {6847#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; {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {6847#false} assume 0 == ~c_dr_pc~0; {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {6847#false} assume !false; {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {6847#false} assume !(1 == ~q_free~0); {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {6847#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; {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {6847#false} assume !(~p_last_write~0 == ~c_last_read~0); {6847#false} is VALID [2022-02-20 19:57:55,193 INFO L272 TraceCheckUtils]: 63: Hoare triple {6847#false} call error1(); {6847#false} is VALID [2022-02-20 19:57:55,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {6847#false} assume !false; {6847#false} is VALID [2022-02-20 19:57:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:55,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:55,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680031160] [2022-02-20 19:57:55,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680031160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:55,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:55,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:55,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492089377] [2022-02-20 19:57:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:55,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:55,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:55,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:55,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:55,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:55,245 INFO L87 Difference]: Start difference. First operand 597 states and 882 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,773 INFO L93 Difference]: Finished difference Result 898 states and 1296 transitions. [2022-02-20 19:57:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2022-02-20 19:57:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2022-02-20 19:57:58,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 772 transitions. [2022-02-20 19:57:59,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 772 edges. 772 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:59,377 INFO L225 Difference]: With dead ends: 898 [2022-02-20 19:57:59,377 INFO L226 Difference]: Without dead ends: 631 [2022-02-20 19:57:59,378 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:57:59,379 INFO L933 BasicCegarLoop]: 604 mSDtfsCounter, 791 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:59,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 2425 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:57:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-02-20 19:57:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 602. [2022-02-20 19:57:59,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:59,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 631 states. Second operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand 631 states. Second operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:59,413 INFO L87 Difference]: Start difference. First operand 631 states. Second operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:59,437 INFO L93 Difference]: Finished difference Result 631 states and 926 transitions. [2022-02-20 19:57:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 926 transitions. [2022-02-20 19:57:59,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:59,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:59,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 631 states. [2022-02-20 19:57:59,442 INFO L87 Difference]: Start difference. First operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 631 states. [2022-02-20 19:57:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:59,466 INFO L93 Difference]: Finished difference Result 631 states and 926 transitions. [2022-02-20 19:57:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 926 transitions. [2022-02-20 19:57:59,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:59,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:59,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:59,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 507 states have (on average 1.485207100591716) internal successors, (753), 516 states have internal predecessors, (753), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 885 transitions. [2022-02-20 19:57:59,496 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 885 transitions. Word has length 65 [2022-02-20 19:57:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:59,497 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 885 transitions. [2022-02-20 19:57:59,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 885 transitions. [2022-02-20 19:57:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:59,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:59,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:59,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:59,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1744111597, now seen corresponding path program 1 times [2022-02-20 19:57:59,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:59,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201776077] [2022-02-20 19:57:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {10225#(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); {10186#true} is VALID [2022-02-20 19:57:59,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10186#true} {10186#true} #1577#return; {10186#true} is VALID [2022-02-20 19:57:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {10226#(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); {10186#true} is VALID [2022-02-20 19:57:59,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume !(0 == ~q_write_ev~0); {10186#true} is VALID [2022-02-20 19:57:59,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10186#true} {10186#true} #1579#return; {10186#true} is VALID [2022-02-20 19:57:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {10186#true} havoc ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume !(1 == ~p_dw_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} ~__retres1~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {10186#true} #res := ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,594 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10186#true} {10186#true} #1573#return; {10186#true} is VALID [2022-02-20 19:57:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {10186#true} havoc ~__retres1~1; {10186#true} is VALID [2022-02-20 19:57:59,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume !(1 == ~c_dr_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} ~__retres1~1 := 0; {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:59,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,626 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10186#true} #1575#return; {10240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:59,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {10227#(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; {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L272 TraceCheckUtils]: 1: Hoare triple {10186#true} call #t~ret8 := is_do_write_p_triggered(); {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} havoc ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {10186#true} assume !(1 == ~p_dw_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {10186#true} ~__retres1~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {10186#true} #res := ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10186#true} {10186#true} #1573#return; {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {10186#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {10186#true} assume !(0 != ~tmp~1); {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L272 TraceCheckUtils]: 10: Hoare triple {10186#true} call #t~ret9 := is_do_read_c_triggered(); {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {10186#true} havoc ~__retres1~1; {10186#true} is VALID [2022-02-20 19:57:59,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {10186#true} assume !(1 == ~c_dr_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {10186#true} ~__retres1~1 := 0; {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:59,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,638 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10186#true} #1575#return; {10240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:59,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {10240#(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; {10241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:59,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {10241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10187#false} is VALID [2022-02-20 19:57:59,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {10187#false} assume true; {10187#false} is VALID [2022-02-20 19:57:59,640 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10187#false} {10186#true} #1581#return; {10187#false} is VALID [2022-02-20 19:57:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {10226#(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); {10186#true} is VALID [2022-02-20 19:57:59,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10186#true} is VALID [2022-02-20 19:57:59,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10186#true} {10187#false} #1583#return; {10187#false} is VALID [2022-02-20 19:57:59,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {10186#true} havoc ~__retres1~2; {10186#true} is VALID [2022-02-20 19:57:59,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10186#true} is VALID [2022-02-20 19:57:59,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} #res := ~__retres1~2; {10186#true} is VALID [2022-02-20 19:57:59,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,654 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10186#true} {10187#false} #1585#return; {10187#false} is VALID [2022-02-20 19:57:59,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {10186#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {10186#true} is VALID [2022-02-20 19:57:59,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {10186#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {10186#true} is VALID [2022-02-20 19:57:59,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {10186#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; {10186#true} is VALID [2022-02-20 19:57:59,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {10186#true} call update_channels1(); {10225#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:59,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {10225#(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); {10186#true} is VALID [2022-02-20 19:57:59,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,656 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10186#true} {10186#true} #1577#return; {10186#true} is VALID [2022-02-20 19:57:59,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {10186#true} assume { :begin_inline_init_threads1 } true; {10186#true} is VALID [2022-02-20 19:57:59,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {10186#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {10186#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {10186#true} assume { :end_inline_init_threads1 } true; {10186#true} is VALID [2022-02-20 19:57:59,657 INFO L272 TraceCheckUtils]: 12: Hoare triple {10186#true} call fire_delta_events1(); {10226#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:59,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {10226#(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); {10186#true} is VALID [2022-02-20 19:57:59,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {10186#true} assume !(0 == ~q_write_ev~0); {10186#true} is VALID [2022-02-20 19:57:59,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10186#true} {10186#true} #1579#return; {10186#true} is VALID [2022-02-20 19:57:59,658 INFO L272 TraceCheckUtils]: 17: Hoare triple {10186#true} call activate_threads1(); {10227#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {10227#(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; {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L272 TraceCheckUtils]: 19: Hoare triple {10186#true} call #t~ret8 := is_do_write_p_triggered(); {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {10186#true} havoc ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {10186#true} assume !(1 == ~p_dw_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {10186#true} ~__retres1~0 := 0; {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {10186#true} #res := ~__retres1~0; {10186#true} is VALID [2022-02-20 19:57:59,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10186#true} {10186#true} #1573#return; {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {10186#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {10186#true} assume !(0 != ~tmp~1); {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {10186#true} call #t~ret9 := is_do_read_c_triggered(); {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {10186#true} havoc ~__retres1~1; {10186#true} is VALID [2022-02-20 19:57:59,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {10186#true} assume !(1 == ~c_dr_pc~0); {10186#true} is VALID [2022-02-20 19:57:59,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {10186#true} ~__retres1~1 := 0; {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:59,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {10242#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:59,662 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10243#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10186#true} #1575#return; {10240#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:59,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {10240#(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; {10241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:59,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {10241#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10187#false} is VALID [2022-02-20 19:57:59,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {10187#false} assume true; {10187#false} is VALID [2022-02-20 19:57:59,663 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10187#false} {10186#true} #1581#return; {10187#false} is VALID [2022-02-20 19:57:59,664 INFO L272 TraceCheckUtils]: 39: Hoare triple {10187#false} call reset_delta_events1(); {10226#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:59,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {10226#(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); {10186#true} is VALID [2022-02-20 19:57:59,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {10186#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10186#true} is VALID [2022-02-20 19:57:59,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,665 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10186#true} {10187#false} #1583#return; {10187#false} is VALID [2022-02-20 19:57:59,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {10187#false} assume !false; {10187#false} is VALID [2022-02-20 19:57:59,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {10187#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; {10187#false} is VALID [2022-02-20 19:57:59,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {10187#false} assume !false; {10187#false} is VALID [2022-02-20 19:57:59,666 INFO L272 TraceCheckUtils]: 47: Hoare triple {10187#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10186#true} is VALID [2022-02-20 19:57:59,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {10186#true} havoc ~__retres1~2; {10186#true} is VALID [2022-02-20 19:57:59,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {10186#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10186#true} is VALID [2022-02-20 19:57:59,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {10186#true} #res := ~__retres1~2; {10186#true} is VALID [2022-02-20 19:57:59,666 INFO L290 TraceCheckUtils]: 51: Hoare triple {10186#true} assume true; {10186#true} is VALID [2022-02-20 19:57:59,666 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10186#true} {10187#false} #1585#return; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {10187#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; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {10187#false} assume 0 != eval1_~tmp___1~0#1; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {10187#false} assume !(0 == ~p_dw_st~0); {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {10187#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; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {10187#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; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {10187#false} assume 0 == ~c_dr_pc~0; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {10187#false} assume !false; {10187#false} is VALID [2022-02-20 19:57:59,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {10187#false} assume !(1 == ~q_free~0); {10187#false} is VALID [2022-02-20 19:57:59,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {10187#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; {10187#false} is VALID [2022-02-20 19:57:59,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {10187#false} assume !(~p_last_write~0 == ~c_last_read~0); {10187#false} is VALID [2022-02-20 19:57:59,668 INFO L272 TraceCheckUtils]: 63: Hoare triple {10187#false} call error1(); {10187#false} is VALID [2022-02-20 19:57:59,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {10187#false} assume !false; {10187#false} is VALID [2022-02-20 19:57:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:59,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:59,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201776077] [2022-02-20 19:57:59,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201776077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:59,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:59,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:59,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620091640] [2022-02-20 19:57:59,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:59,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:59,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:59,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:59,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:59,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:59,722 INFO L87 Difference]: Start difference. First operand 602 states and 885 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:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,022 INFO L93 Difference]: Finished difference Result 920 states and 1318 transitions. [2022-02-20 19:58:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:03,023 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:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:03,023 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:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 776 transitions. [2022-02-20 19:58:03,030 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:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 776 transitions. [2022-02-20 19:58:03,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 776 transitions. [2022-02-20 19:58:03,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:03,690 INFO L225 Difference]: With dead ends: 920 [2022-02-20 19:58:03,690 INFO L226 Difference]: Without dead ends: 648 [2022-02-20 19:58:03,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:03,699 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 532 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:03,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 2701 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-02-20 19:58:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 617. [2022-02-20 19:58:03,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:03,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 648 states. Second operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:58:03,745 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:58:03,746 INFO L87 Difference]: Start difference. First operand 648 states. Second operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:58:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,771 INFO L93 Difference]: Finished difference Result 648 states and 944 transitions. [2022-02-20 19:58:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 944 transitions. [2022-02-20 19:58:03,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 648 states. [2022-02-20 19:58:03,777 INFO L87 Difference]: Start difference. First operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 648 states. [2022-02-20 19:58:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,803 INFO L93 Difference]: Finished difference Result 648 states and 944 transitions. [2022-02-20 19:58:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 944 transitions. [2022-02-20 19:58:03,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:03,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 519 states have (on average 1.4739884393063585) internal successors, (765), 528 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:58:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 900 transitions. [2022-02-20 19:58:03,834 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 900 transitions. Word has length 65 [2022-02-20 19:58:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:03,834 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 900 transitions. [2022-02-20 19:58:03,835 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:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 900 transitions. [2022-02-20 19:58:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:03,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:03,837 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,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:03,837 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -357908203, now seen corresponding path program 1 times [2022-02-20 19:58:03,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:03,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600905898] [2022-02-20 19:58:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {13646#(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); {13647#(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,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13647#(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,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1577#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {13647#(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); {13647#(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,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {13647#(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,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13647#(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,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1579#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {13606#true} havoc ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {13606#true} assume !(1 == ~p_dw_pc~0); {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {13606#true} ~__retres1~0 := 0; {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {13606#true} #res := ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13606#true} {13606#true} #1573#return; {13606#true} is VALID [2022-02-20 19:58:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {13606#true} havoc ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {13606#true} assume !(1 == ~c_dr_pc~0); {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {13606#true} ~__retres1~1 := 0; {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L290 TraceCheckUtils]: 3: Hoare triple {13606#true} #res := ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13606#true} {13606#true} #1575#return; {13606#true} is VALID [2022-02-20 19:58:03,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {13648#(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; {13606#true} is VALID [2022-02-20 19:58:03,972 INFO L272 TraceCheckUtils]: 1: Hoare triple {13606#true} call #t~ret8 := is_do_write_p_triggered(); {13606#true} is VALID [2022-02-20 19:58:03,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {13606#true} havoc ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {13606#true} assume !(1 == ~p_dw_pc~0); {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {13606#true} ~__retres1~0 := 0; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {13606#true} #res := ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13606#true} {13606#true} #1573#return; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {13606#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13606#true} is VALID [2022-02-20 19:58:03,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {13606#true} assume !(0 != ~tmp~1); {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L272 TraceCheckUtils]: 10: Hoare triple {13606#true} call #t~ret9 := is_do_read_c_triggered(); {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {13606#true} havoc ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {13606#true} assume !(1 == ~c_dr_pc~0); {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {13606#true} ~__retres1~1 := 0; {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {13606#true} #res := ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:03,974 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13606#true} {13606#true} #1575#return; {13606#true} is VALID [2022-02-20 19:58:03,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {13606#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13606#true} is VALID [2022-02-20 19:58:03,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {13606#true} assume !(0 != ~tmp___0~1); {13606#true} is VALID [2022-02-20 19:58:03,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:03,975 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13606#true} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1581#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {13647#(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); {13661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {13661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1583#return; {13607#false} is VALID [2022-02-20 19:58:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:04,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {13606#true} havoc ~__retres1~2; {13606#true} is VALID [2022-02-20 19:58:04,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {13606#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13606#true} is VALID [2022-02-20 19:58:04,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {13606#true} #res := ~__retres1~2; {13606#true} is VALID [2022-02-20 19:58:04,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:04,013 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13606#true} {13607#false} #1585#return; {13607#false} is VALID [2022-02-20 19:58:04,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {13606#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {13606#true} is VALID [2022-02-20 19:58:04,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {13606#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {13606#true} is VALID [2022-02-20 19:58:04,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {13606#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {13608#(= ~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; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13646#(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:04,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {13646#(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); {13647#(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:04,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13647#(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:04,016 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1577#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,018 INFO L272 TraceCheckUtils]: 12: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13647#(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:04,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {13647#(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); {13647#(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:04,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {13647#(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:04,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13647#(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:04,019 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1579#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,020 INFO L272 TraceCheckUtils]: 17: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13648#(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:04,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {13648#(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; {13606#true} is VALID [2022-02-20 19:58:04,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {13606#true} call #t~ret8 := is_do_write_p_triggered(); {13606#true} is VALID [2022-02-20 19:58:04,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {13606#true} havoc ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {13606#true} assume !(1 == ~p_dw_pc~0); {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {13606#true} ~__retres1~0 := 0; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {13606#true} #res := ~__retres1~0; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13606#true} {13606#true} #1573#return; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {13606#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {13606#true} assume !(0 != ~tmp~1); {13606#true} is VALID [2022-02-20 19:58:04,021 INFO L272 TraceCheckUtils]: 28: Hoare triple {13606#true} call #t~ret9 := is_do_read_c_triggered(); {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {13606#true} havoc ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {13606#true} assume !(1 == ~c_dr_pc~0); {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {13606#true} ~__retres1~1 := 0; {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {13606#true} #res := ~__retres1~1; {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13606#true} {13606#true} #1575#return; {13606#true} is VALID [2022-02-20 19:58:04,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {13606#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13606#true} is VALID [2022-02-20 19:58:04,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {13606#true} assume !(0 != ~tmp___0~1); {13606#true} is VALID [2022-02-20 19:58:04,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:04,023 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13606#true} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1581#return; {13608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:04,024 INFO L272 TraceCheckUtils]: 39: Hoare triple {13608#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13647#(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:04,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {13647#(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); {13661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:04,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {13661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:04,025 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13608#(= ~q_write_ev~0 ~q_read_ev~0)} #1583#return; {13607#false} is VALID [2022-02-20 19:58:04,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {13607#false} assume !false; {13607#false} is VALID [2022-02-20 19:58:04,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {13607#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; {13607#false} is VALID [2022-02-20 19:58:04,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {13607#false} assume !false; {13607#false} is VALID [2022-02-20 19:58:04,031 INFO L272 TraceCheckUtils]: 47: Hoare triple {13607#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13606#true} is VALID [2022-02-20 19:58:04,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {13606#true} havoc ~__retres1~2; {13606#true} is VALID [2022-02-20 19:58:04,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {13606#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13606#true} is VALID [2022-02-20 19:58:04,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {13606#true} #res := ~__retres1~2; {13606#true} is VALID [2022-02-20 19:58:04,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {13606#true} assume true; {13606#true} is VALID [2022-02-20 19:58:04,031 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13606#true} {13607#false} #1585#return; {13607#false} is VALID [2022-02-20 19:58:04,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {13607#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; {13607#false} is VALID [2022-02-20 19:58:04,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {13607#false} assume 0 != eval1_~tmp___1~0#1; {13607#false} is VALID [2022-02-20 19:58:04,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {13607#false} assume !(0 == ~p_dw_st~0); {13607#false} is VALID [2022-02-20 19:58:04,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {13607#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; {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {13607#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; {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {13607#false} assume 0 == ~c_dr_pc~0; {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {13607#false} assume !false; {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {13607#false} assume !(1 == ~q_free~0); {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {13607#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; {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {13607#false} assume !(~p_last_write~0 == ~c_last_read~0); {13607#false} is VALID [2022-02-20 19:58:04,033 INFO L272 TraceCheckUtils]: 63: Hoare triple {13607#false} call error1(); {13607#false} is VALID [2022-02-20 19:58:04,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {13607#false} assume !false; {13607#false} is VALID [2022-02-20 19:58:04,034 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:04,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:04,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600905898] [2022-02-20 19:58:04,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600905898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:04,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:04,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:04,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710961229] [2022-02-20 19:58:04,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:04,036 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:04,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:04,036 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:04,075 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:04,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:04,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:04,077 INFO L87 Difference]: Start difference. First operand 617 states and 900 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:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:07,379 INFO L93 Difference]: Finished difference Result 1009 states and 1411 transitions. [2022-02-20 19:58:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:07,380 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:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:07,380 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:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 955 transitions. [2022-02-20 19:58:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 955 transitions. [2022-02-20 19:58:07,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 955 transitions. [2022-02-20 19:58:08,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 955 edges. 955 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:08,190 INFO L225 Difference]: With dead ends: 1009 [2022-02-20 19:58:08,190 INFO L226 Difference]: Without dead ends: 724 [2022-02-20 19:58:08,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:08,191 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 1207 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:08,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 2116 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-02-20 19:58:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 629. [2022-02-20 19:58:08,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:08,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 724 states. Second operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:08,233 INFO L74 IsIncluded]: Start isIncluded. First operand 724 states. Second operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:08,234 INFO L87 Difference]: Start difference. First operand 724 states. Second operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:08,265 INFO L93 Difference]: Finished difference Result 724 states and 1031 transitions. [2022-02-20 19:58:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1031 transitions. [2022-02-20 19:58:08,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:08,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:08,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 724 states. [2022-02-20 19:58:08,270 INFO L87 Difference]: Start difference. First operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 724 states. [2022-02-20 19:58:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:08,300 INFO L93 Difference]: Finished difference Result 724 states and 1031 transitions. [2022-02-20 19:58:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1031 transitions. [2022-02-20 19:58:08,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:08,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:08,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:08,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 538 states have internal predecessors, (775), 62 states have call successors, (62), 30 states have call predecessors, (62), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2022-02-20 19:58:08,331 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 65 [2022-02-20 19:58:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:08,332 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2022-02-20 19:58:08,332 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:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2022-02-20 19:58:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:08,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:08,333 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,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:08,334 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash -491921709, now seen corresponding path program 1 times [2022-02-20 19:58:08,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:08,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179141407] [2022-02-20 19:58:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {17351#(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); {17311#true} is VALID [2022-02-20 19:58:08,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17311#true} {17311#true} #1577#return; {17311#true} is VALID [2022-02-20 19:58:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {17352#(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); {17311#true} is VALID [2022-02-20 19:58:08,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume !(0 == ~q_write_ev~0); {17311#true} is VALID [2022-02-20 19:58:08,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17311#true} {17316#(= ~p_dw_st~0 0)} #1579#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {17311#true} havoc ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume !(1 == ~p_dw_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} ~__retres1~0 := 0; {17311#true} is VALID [2022-02-20 19:58:08,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {17311#true} #res := ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,446 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1573#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {17311#true} havoc ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume !(1 == ~c_dr_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} ~__retres1~1 := 0; {17311#true} is VALID [2022-02-20 19:58:08,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {17311#true} #res := ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,452 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1575#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {17353#(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; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,453 INFO L272 TraceCheckUtils]: 1: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17311#true} is VALID [2022-02-20 19:58:08,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} havoc ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {17311#true} assume !(1 == ~p_dw_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {17311#true} ~__retres1~0 := 0; {17311#true} is VALID [2022-02-20 19:58:08,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {17311#true} #res := ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,454 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1573#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,455 INFO L272 TraceCheckUtils]: 10: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17311#true} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {17311#true} havoc ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {17311#true} assume !(1 == ~c_dr_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {17311#true} ~__retres1~1 := 0; {17311#true} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {17311#true} #res := ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,456 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1575#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,458 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17316#(= ~p_dw_st~0 0)} #1581#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {17352#(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); {17311#true} is VALID [2022-02-20 19:58:08,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume !(1 == ~q_write_ev~0); {17311#true} is VALID [2022-02-20 19:58:08,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17311#true} {17316#(= ~p_dw_st~0 0)} #1583#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:08,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {17311#true} havoc ~__retres1~2; {17311#true} is VALID [2022-02-20 19:58:08,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {17316#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {17316#(= ~p_dw_st~0 0)} assume true; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,486 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17316#(= ~p_dw_st~0 0)} {17316#(= ~p_dw_st~0 0)} #1585#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {17311#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {17311#true} is VALID [2022-02-20 19:58:08,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {17311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {17311#true} is VALID [2022-02-20 19:58:08,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {17311#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {17311#true} is VALID [2022-02-20 19:58:08,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {17311#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; {17311#true} is VALID [2022-02-20 19:58:08,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {17311#true} call update_channels1(); {17351#(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,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {17351#(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); {17311#true} is VALID [2022-02-20 19:58:08,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,488 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17311#true} {17311#true} #1577#return; {17311#true} is VALID [2022-02-20 19:58:08,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {17311#true} assume { :begin_inline_init_threads1 } true; {17311#true} is VALID [2022-02-20 19:58:08,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {17311#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {17316#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {17316#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {17316#(= ~p_dw_st~0 0)} call fire_delta_events1(); {17352#(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,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {17352#(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); {17311#true} is VALID [2022-02-20 19:58:08,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {17311#true} assume !(0 == ~q_write_ev~0); {17311#true} is VALID [2022-02-20 19:58:08,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,490 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17311#true} {17316#(= ~p_dw_st~0 0)} #1579#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {17316#(= ~p_dw_st~0 0)} call activate_threads1(); {17353#(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,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {17353#(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; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,491 INFO L272 TraceCheckUtils]: 19: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17311#true} is VALID [2022-02-20 19:58:08,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {17311#true} havoc ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {17311#true} assume !(1 == ~p_dw_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {17311#true} ~__retres1~0 := 0; {17311#true} is VALID [2022-02-20 19:58:08,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {17311#true} #res := ~__retres1~0; {17311#true} is VALID [2022-02-20 19:58:08,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,492 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1573#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,493 INFO L272 TraceCheckUtils]: 28: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17311#true} is VALID [2022-02-20 19:58:08,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {17311#true} havoc ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {17311#true} assume !(1 == ~c_dr_pc~0); {17311#true} is VALID [2022-02-20 19:58:08,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {17311#true} ~__retres1~1 := 0; {17311#true} is VALID [2022-02-20 19:58:08,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {17311#true} #res := ~__retres1~1; {17311#true} is VALID [2022-02-20 19:58:08,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,494 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17311#true} {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1575#return; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:08,496 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17316#(= ~p_dw_st~0 0)} #1581#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,496 INFO L272 TraceCheckUtils]: 39: Hoare triple {17316#(= ~p_dw_st~0 0)} call reset_delta_events1(); {17352#(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,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {17352#(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); {17311#true} is VALID [2022-02-20 19:58:08,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {17311#true} assume !(1 == ~q_write_ev~0); {17311#true} is VALID [2022-02-20 19:58:08,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {17311#true} assume true; {17311#true} is VALID [2022-02-20 19:58:08,497 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17311#true} {17316#(= ~p_dw_st~0 0)} #1583#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {17316#(= ~p_dw_st~0 0)} assume !false; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {17316#(= ~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; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {17316#(= ~p_dw_st~0 0)} assume !false; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,498 INFO L272 TraceCheckUtils]: 47: Hoare triple {17316#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17311#true} is VALID [2022-02-20 19:58:08,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {17311#true} havoc ~__retres1~2; {17311#true} is VALID [2022-02-20 19:58:08,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {17311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {17316#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {17316#(= ~p_dw_st~0 0)} assume true; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,500 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17316#(= ~p_dw_st~0 0)} {17316#(= ~p_dw_st~0 0)} #1585#return; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {17316#(= ~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; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {17316#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {17316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {17316#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {17312#false} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {17312#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; {17312#false} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {17312#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; {17312#false} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {17312#false} assume 0 == ~c_dr_pc~0; {17312#false} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {17312#false} assume !false; {17312#false} is VALID [2022-02-20 19:58:08,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {17312#false} assume !(1 == ~q_free~0); {17312#false} is VALID [2022-02-20 19:58:08,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {17312#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; {17312#false} is VALID [2022-02-20 19:58:08,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {17312#false} assume !(~p_last_write~0 == ~c_last_read~0); {17312#false} is VALID [2022-02-20 19:58:08,502 INFO L272 TraceCheckUtils]: 63: Hoare triple {17312#false} call error1(); {17312#false} is VALID [2022-02-20 19:58:08,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {17312#false} assume !false; {17312#false} is VALID [2022-02-20 19:58:08,502 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,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:08,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179141407] [2022-02-20 19:58:08,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179141407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:08,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:08,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:08,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204933343] [2022-02-20 19:58:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:08,504 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:08,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:08,504 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:08,544 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,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:08,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:08,545 INFO L87 Difference]: Start difference. First operand 629 states and 910 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:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,540 INFO L93 Difference]: Finished difference Result 1271 states and 1757 transitions. [2022-02-20 19:58:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:10,540 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:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:10,541 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:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 898 transitions. [2022-02-20 19:58:10,548 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:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 898 transitions. [2022-02-20 19:58:10,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 898 transitions. [2022-02-20 19:58:11,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 898 edges. 898 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:11,346 INFO L225 Difference]: With dead ends: 1271 [2022-02-20 19:58:11,346 INFO L226 Difference]: Without dead ends: 975 [2022-02-20 19:58:11,348 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:11,348 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1472 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:11,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1469 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-02-20 19:58:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 919. [2022-02-20 19:58:11,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:11,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 975 states. Second operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:11,422 INFO L74 IsIncluded]: Start isIncluded. First operand 975 states. Second operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:11,424 INFO L87 Difference]: Start difference. First operand 975 states. Second operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:11,475 INFO L93 Difference]: Finished difference Result 975 states and 1363 transitions. [2022-02-20 19:58:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1363 transitions. [2022-02-20 19:58:11,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:11,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:11,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) Second operand 975 states. [2022-02-20 19:58:11,483 INFO L87 Difference]: Start difference. First operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) Second operand 975 states. [2022-02-20 19:58:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:11,531 INFO L93 Difference]: Finished difference Result 975 states and 1363 transitions. [2022-02-20 19:58:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1363 transitions. [2022-02-20 19:58:11,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:11,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:11,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:11,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 753 states have (on average 1.4103585657370519) internal successors, (1062), 769 states have internal predecessors, (1062), 97 states have call successors, (97), 52 states have call predecessors, (97), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1289 transitions. [2022-02-20 19:58:11,593 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1289 transitions. Word has length 65 [2022-02-20 19:58:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:11,594 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1289 transitions. [2022-02-20 19:58:11,594 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:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1289 transitions. [2022-02-20 19:58:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:11,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:11,596 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:11,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:11,597 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1681946624, now seen corresponding path program 1 times [2022-02-20 19:58:11,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:11,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218734021] [2022-02-20 19:58:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {22302#(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); {22262#true} is VALID [2022-02-20 19:58:11,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1577#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {22303#(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); {22262#true} is VALID [2022-02-20 19:58:11,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume !(0 == ~q_write_ev~0); {22262#true} is VALID [2022-02-20 19:58:11,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1579#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {22262#true} havoc ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume !(1 == ~p_dw_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} ~__retres1~0 := 0; {22262#true} is VALID [2022-02-20 19:58:11,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {22262#true} #res := ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,676 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22262#true} {22262#true} #1573#return; {22262#true} is VALID [2022-02-20 19:58:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {22262#true} havoc ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume !(1 == ~c_dr_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} ~__retres1~1 := 0; {22262#true} is VALID [2022-02-20 19:58:11,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {22262#true} #res := ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,695 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22262#true} {22262#true} #1575#return; {22262#true} is VALID [2022-02-20 19:58:11,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {22304#(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; {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L272 TraceCheckUtils]: 1: Hoare triple {22262#true} call #t~ret8 := is_do_write_p_triggered(); {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} havoc ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {22262#true} assume !(1 == ~p_dw_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {22262#true} ~__retres1~0 := 0; {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {22262#true} #res := ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,696 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22262#true} {22262#true} #1573#return; {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {22262#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {22262#true} assume !(0 != ~tmp~1); {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {22262#true} call #t~ret9 := is_do_read_c_triggered(); {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {22262#true} havoc ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {22262#true} assume !(1 == ~c_dr_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {22262#true} ~__retres1~1 := 0; {22262#true} is VALID [2022-02-20 19:58:11,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {22262#true} #res := ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,698 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22262#true} {22262#true} #1575#return; {22262#true} is VALID [2022-02-20 19:58:11,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {22262#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22262#true} is VALID [2022-02-20 19:58:11,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {22262#true} assume !(0 != ~tmp___0~1); {22262#true} is VALID [2022-02-20 19:58:11,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,699 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1581#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {22303#(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); {22262#true} is VALID [2022-02-20 19:58:11,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume !(1 == ~q_write_ev~0); {22262#true} is VALID [2022-02-20 19:58:11,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1583#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {22262#true} havoc ~__retres1~2; {22262#true} is VALID [2022-02-20 19:58:11,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22262#true} is VALID [2022-02-20 19:58:11,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} #res := ~__retres1~2; {22262#true} is VALID [2022-02-20 19:58:11,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,715 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1585#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {22262#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22262#true} is VALID [2022-02-20 19:58:11,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {22262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {22262#true} is VALID [2022-02-20 19:58:11,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {22262#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {22264#(= ~q_free~0 1)} call update_channels1(); {22302#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:11,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {22302#(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); {22262#true} is VALID [2022-02-20 19:58:11,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,718 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1577#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {22264#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {22264#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {22264#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {22264#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {22264#(= ~q_free~0 1)} call fire_delta_events1(); {22303#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {22303#(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); {22262#true} is VALID [2022-02-20 19:58:11,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {22262#true} assume !(0 == ~q_write_ev~0); {22262#true} is VALID [2022-02-20 19:58:11,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,720 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1579#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {22264#(= ~q_free~0 1)} call activate_threads1(); {22304#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:11,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {22304#(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; {22262#true} is VALID [2022-02-20 19:58:11,721 INFO L272 TraceCheckUtils]: 19: Hoare triple {22262#true} call #t~ret8 := is_do_write_p_triggered(); {22262#true} is VALID [2022-02-20 19:58:11,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {22262#true} havoc ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {22262#true} assume !(1 == ~p_dw_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {22262#true} ~__retres1~0 := 0; {22262#true} is VALID [2022-02-20 19:58:11,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {22262#true} #res := ~__retres1~0; {22262#true} is VALID [2022-02-20 19:58:11,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,722 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22262#true} {22262#true} #1573#return; {22262#true} is VALID [2022-02-20 19:58:11,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {22262#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22262#true} is VALID [2022-02-20 19:58:11,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {22262#true} assume !(0 != ~tmp~1); {22262#true} is VALID [2022-02-20 19:58:11,723 INFO L272 TraceCheckUtils]: 28: Hoare triple {22262#true} call #t~ret9 := is_do_read_c_triggered(); {22262#true} is VALID [2022-02-20 19:58:11,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {22262#true} havoc ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {22262#true} assume !(1 == ~c_dr_pc~0); {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {22262#true} ~__retres1~1 := 0; {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {22262#true} #res := ~__retres1~1; {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22262#true} {22262#true} #1575#return; {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {22262#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {22262#true} assume !(0 != ~tmp___0~1); {22262#true} is VALID [2022-02-20 19:58:11,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,725 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1581#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,725 INFO L272 TraceCheckUtils]: 39: Hoare triple {22264#(= ~q_free~0 1)} call reset_delta_events1(); {22303#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {22303#(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); {22262#true} is VALID [2022-02-20 19:58:11,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {22262#true} assume !(1 == ~q_write_ev~0); {22262#true} is VALID [2022-02-20 19:58:11,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,726 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1583#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {22264#(= ~q_free~0 1)} assume !false; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {22264#(= ~q_free~0 1)} assume !false; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,727 INFO L272 TraceCheckUtils]: 47: Hoare triple {22264#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22262#true} is VALID [2022-02-20 19:58:11,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {22262#true} havoc ~__retres1~2; {22262#true} is VALID [2022-02-20 19:58:11,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {22262#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22262#true} is VALID [2022-02-20 19:58:11,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {22262#true} #res := ~__retres1~2; {22262#true} is VALID [2022-02-20 19:58:11,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {22262#true} assume true; {22262#true} is VALID [2022-02-20 19:58:11,728 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22262#true} {22264#(= ~q_free~0 1)} #1585#return; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {22264#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {22264#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {22264#(= ~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; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {22264#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {22264#(= ~q_free~0 1)} assume !false; {22264#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:11,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {22264#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {22263#false} is VALID [2022-02-20 19:58:11,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {22263#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; {22263#false} is VALID [2022-02-20 19:58:11,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {22263#false} assume !(~p_last_write~0 == ~c_last_read~0); {22263#false} is VALID [2022-02-20 19:58:11,739 INFO L272 TraceCheckUtils]: 64: Hoare triple {22263#false} call error1(); {22263#false} is VALID [2022-02-20 19:58:11,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {22263#false} assume !false; {22263#false} is VALID [2022-02-20 19:58:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:11,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:11,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218734021] [2022-02-20 19:58:11,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218734021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:11,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:11,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:11,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423547282] [2022-02-20 19:58:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:11,742 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:11,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:11,742 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:11,782 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:11,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:11,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:11,783 INFO L87 Difference]: Start difference. First operand 919 states and 1289 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:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,739 INFO L93 Difference]: Finished difference Result 2122 states and 2860 transitions. [2022-02-20 19:58:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:13,739 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:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,740 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:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 896 transitions. [2022-02-20 19:58:13,747 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:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 896 transitions. [2022-02-20 19:58:13,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 896 transitions. [2022-02-20 19:58:14,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 896 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:14,509 INFO L225 Difference]: With dead ends: 2122 [2022-02-20 19:58:14,509 INFO L226 Difference]: Without dead ends: 1515 [2022-02-20 19:58:14,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:14,511 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 712 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:14,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 1719 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-02-20 19:58:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1400. [2022-02-20 19:58:14,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:14,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:14,613 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:14,615 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,708 INFO L93 Difference]: Finished difference Result 1515 states and 2022 transitions. [2022-02-20 19:58:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2022 transitions. [2022-02-20 19:58:14,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) Second operand 1515 states. [2022-02-20 19:58:14,717 INFO L87 Difference]: Start difference. First operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) Second operand 1515 states. [2022-02-20 19:58:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,821 INFO L93 Difference]: Finished difference Result 1515 states and 2022 transitions. [2022-02-20 19:58:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2022 transitions. [2022-02-20 19:58:14,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:14,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1132 states have (on average 1.3630742049469964) internal successors, (1543), 1151 states have internal predecessors, (1543), 142 states have call successors, (142), 96 states have call predecessors, (142), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1887 transitions. [2022-02-20 19:58:14,945 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1887 transitions. Word has length 66 [2022-02-20 19:58:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:14,945 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1887 transitions. [2022-02-20 19:58:14,946 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:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1887 transitions. [2022-02-20 19:58:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:14,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:14,952 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:14,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:14,952 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -223706965, now seen corresponding path program 1 times [2022-02-20 19:58:14,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:14,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851797247] [2022-02-20 19:58:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {30094#(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); {30054#true} is VALID [2022-02-20 19:58:15,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1577#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {30095#(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); {30054#true} is VALID [2022-02-20 19:58:15,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume !(0 == ~q_write_ev~0); {30054#true} is VALID [2022-02-20 19:58:15,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1579#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {30054#true} havoc ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume !(1 == ~p_dw_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} ~__retres1~0 := 0; {30054#true} is VALID [2022-02-20 19:58:15,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {30054#true} #res := ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,032 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30054#true} {30054#true} #1573#return; {30054#true} is VALID [2022-02-20 19:58:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {30054#true} havoc ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume !(1 == ~c_dr_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} ~__retres1~1 := 0; {30054#true} is VALID [2022-02-20 19:58:15,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {30054#true} #res := ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30054#true} {30054#true} #1575#return; {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {30096#(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; {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L272 TraceCheckUtils]: 1: Hoare triple {30054#true} call #t~ret8 := is_do_write_p_triggered(); {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} havoc ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {30054#true} assume !(1 == ~p_dw_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {30054#true} ~__retres1~0 := 0; {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {30054#true} #res := ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30054#true} {30054#true} #1573#return; {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {30054#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {30054#true} assume !(0 != ~tmp~1); {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L272 TraceCheckUtils]: 10: Hoare triple {30054#true} call #t~ret9 := is_do_read_c_triggered(); {30054#true} is VALID [2022-02-20 19:58:15,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {30054#true} havoc ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {30054#true} assume !(1 == ~c_dr_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {30054#true} ~__retres1~1 := 0; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {30054#true} #res := ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30054#true} {30054#true} #1575#return; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {30054#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {30054#true} assume !(0 != ~tmp___0~1); {30054#true} is VALID [2022-02-20 19:58:15,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,050 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1581#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {30095#(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); {30054#true} is VALID [2022-02-20 19:58:15,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume !(1 == ~q_write_ev~0); {30054#true} is VALID [2022-02-20 19:58:15,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1583#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {30054#true} havoc ~__retres1~2; {30054#true} is VALID [2022-02-20 19:58:15,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30054#true} is VALID [2022-02-20 19:58:15,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} #res := ~__retres1~2; {30054#true} is VALID [2022-02-20 19:58:15,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1585#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {30054#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {30054#true} is VALID [2022-02-20 19:58:15,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {30054#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {30054#true} is VALID [2022-02-20 19:58:15,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {30054#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {30056#(= ~c_dr_pc~0 0)} call update_channels1(); {30094#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:15,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {30094#(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); {30054#true} is VALID [2022-02-20 19:58:15,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,066 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1577#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,068 INFO L272 TraceCheckUtils]: 12: Hoare triple {30056#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {30095#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {30095#(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); {30054#true} is VALID [2022-02-20 19:58:15,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {30054#true} assume !(0 == ~q_write_ev~0); {30054#true} is VALID [2022-02-20 19:58:15,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,069 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1579#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,069 INFO L272 TraceCheckUtils]: 17: Hoare triple {30056#(= ~c_dr_pc~0 0)} call activate_threads1(); {30096#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {30096#(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; {30054#true} is VALID [2022-02-20 19:58:15,069 INFO L272 TraceCheckUtils]: 19: Hoare triple {30054#true} call #t~ret8 := is_do_write_p_triggered(); {30054#true} is VALID [2022-02-20 19:58:15,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {30054#true} havoc ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {30054#true} assume !(1 == ~p_dw_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {30054#true} ~__retres1~0 := 0; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {30054#true} #res := ~__retres1~0; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30054#true} {30054#true} #1573#return; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {30054#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30054#true} is VALID [2022-02-20 19:58:15,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {30054#true} assume !(0 != ~tmp~1); {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L272 TraceCheckUtils]: 28: Hoare triple {30054#true} call #t~ret9 := is_do_read_c_triggered(); {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {30054#true} havoc ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {30054#true} assume !(1 == ~c_dr_pc~0); {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {30054#true} ~__retres1~1 := 0; {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {30054#true} #res := ~__retres1~1; {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,071 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30054#true} {30054#true} #1575#return; {30054#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {30054#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30054#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {30054#true} assume !(0 != ~tmp___0~1); {30054#true} is VALID [2022-02-20 19:58:15,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,072 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1581#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,073 INFO L272 TraceCheckUtils]: 39: Hoare triple {30056#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {30095#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {30095#(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); {30054#true} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {30054#true} assume !(1 == ~q_write_ev~0); {30054#true} is VALID [2022-02-20 19:58:15,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,074 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1583#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume !false; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {30056#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume !false; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,075 INFO L272 TraceCheckUtils]: 47: Hoare triple {30056#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30054#true} is VALID [2022-02-20 19:58:15,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {30054#true} havoc ~__retres1~2; {30054#true} is VALID [2022-02-20 19:58:15,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {30054#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30054#true} is VALID [2022-02-20 19:58:15,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {30054#true} #res := ~__retres1~2; {30054#true} is VALID [2022-02-20 19:58:15,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {30054#true} assume true; {30054#true} is VALID [2022-02-20 19:58:15,076 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30054#true} {30056#(= ~c_dr_pc~0 0)} #1585#return; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {30056#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {30056#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {30055#false} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {30055#false} assume 1 == ~c_dr_pc~0; {30055#false} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {30055#false} do_read_c_~a~0#1 := ~a_t~0; {30055#false} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {30055#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; {30055#false} is VALID [2022-02-20 19:58:15,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {30055#false} assume !(~p_last_write~0 == ~c_last_read~0); {30055#false} is VALID [2022-02-20 19:58:15,079 INFO L272 TraceCheckUtils]: 64: Hoare triple {30055#false} call error1(); {30055#false} is VALID [2022-02-20 19:58:15,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {30055#false} assume !false; {30055#false} is VALID [2022-02-20 19:58:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:15,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:15,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851797247] [2022-02-20 19:58:15,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851797247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:15,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:15,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:15,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116835534] [2022-02-20 19:58:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:15,081 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:15,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:15,081 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:15,121 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:15,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:15,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:15,123 INFO L87 Difference]: Start difference. First operand 1400 states and 1887 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:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,394 INFO L93 Difference]: Finished difference Result 3588 states and 4693 transitions. [2022-02-20 19:58:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:17,394 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:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:17,394 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:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 894 transitions. [2022-02-20 19:58:17,400 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:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 894 transitions. [2022-02-20 19:58:17,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 894 transitions. [2022-02-20 19:58:18,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 894 edges. 894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:18,294 INFO L225 Difference]: With dead ends: 3588 [2022-02-20 19:58:18,294 INFO L226 Difference]: Without dead ends: 2520 [2022-02-20 19:58:18,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:58:18,297 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 1175 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:18,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1205 Valid, 1479 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-02-20 19:58:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2262. [2022-02-20 19:58:18,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:18,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2520 states. Second operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:18,460 INFO L74 IsIncluded]: Start isIncluded. First operand 2520 states. Second operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:18,464 INFO L87 Difference]: Start difference. First operand 2520 states. Second operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,725 INFO L93 Difference]: Finished difference Result 2520 states and 3248 transitions. [2022-02-20 19:58:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3248 transitions. [2022-02-20 19:58:18,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:18,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:18,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) Second operand 2520 states. [2022-02-20 19:58:18,739 INFO L87 Difference]: Start difference. First operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) Second operand 2520 states. [2022-02-20 19:58:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,977 INFO L93 Difference]: Finished difference Result 2520 states and 3248 transitions. [2022-02-20 19:58:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3248 transitions. [2022-02-20 19:58:18,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:18,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:18,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:18,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 1798 states have (on average 1.318131256952169) internal successors, (2370), 1827 states have internal predecessors, (2370), 240 states have call successors, (240), 180 states have call predecessors, (240), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2948 transitions. [2022-02-20 19:58:19,232 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2948 transitions. Word has length 66 [2022-02-20 19:58:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,232 INFO L470 AbstractCegarLoop]: Abstraction has 2262 states and 2948 transitions. [2022-02-20 19:58:19,233 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:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2948 transitions. [2022-02-20 19:58:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:19,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,235 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:19,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:19,235 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1790634273, now seen corresponding path program 1 times [2022-02-20 19:58:19,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555266321] [2022-02-20 19:58:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {43005#(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); {42965#true} is VALID [2022-02-20 19:58:19,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1577#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {43006#(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); {42965#true} is VALID [2022-02-20 19:58:19,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume !(0 == ~q_write_ev~0); {42965#true} is VALID [2022-02-20 19:58:19,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1579#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {42965#true} havoc ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume !(1 == ~p_dw_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} ~__retres1~0 := 0; {42965#true} is VALID [2022-02-20 19:58:19,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {42965#true} #res := ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,315 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42965#true} {42965#true} #1573#return; {42965#true} is VALID [2022-02-20 19:58:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {42965#true} havoc ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume !(1 == ~c_dr_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} ~__retres1~1 := 0; {42965#true} is VALID [2022-02-20 19:58:19,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {42965#true} #res := ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42965#true} {42965#true} #1575#return; {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {43007#(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; {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L272 TraceCheckUtils]: 1: Hoare triple {42965#true} call #t~ret8 := is_do_write_p_triggered(); {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} havoc ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {42965#true} assume !(1 == ~p_dw_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {42965#true} ~__retres1~0 := 0; {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {42965#true} #res := ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42965#true} {42965#true} #1573#return; {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {42965#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {42965#true} assume !(0 != ~tmp~1); {42965#true} is VALID [2022-02-20 19:58:19,321 INFO L272 TraceCheckUtils]: 10: Hoare triple {42965#true} call #t~ret9 := is_do_read_c_triggered(); {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {42965#true} havoc ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {42965#true} assume !(1 == ~c_dr_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {42965#true} ~__retres1~1 := 0; {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {42965#true} #res := ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42965#true} {42965#true} #1575#return; {42965#true} is VALID [2022-02-20 19:58:19,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {42965#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42965#true} is VALID [2022-02-20 19:58:19,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {42965#true} assume !(0 != ~tmp___0~1); {42965#true} is VALID [2022-02-20 19:58:19,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,324 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1581#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {43006#(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); {42965#true} is VALID [2022-02-20 19:58:19,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume !(1 == ~q_write_ev~0); {42965#true} is VALID [2022-02-20 19:58:19,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1583#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {42965#true} havoc ~__retres1~2; {42965#true} is VALID [2022-02-20 19:58:19,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42965#true} is VALID [2022-02-20 19:58:19,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} #res := ~__retres1~2; {42965#true} is VALID [2022-02-20 19:58:19,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,334 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1585#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {42965#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {42965#true} is VALID [2022-02-20 19:58:19,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {42965#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {42965#true} is VALID [2022-02-20 19:58:19,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {42965#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {42967#(= ~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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {42967#(= ~p_dw_pc~0 0)} call update_channels1(); {43005#(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:19,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {43005#(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); {42965#true} is VALID [2022-02-20 19:58:19,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,336 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1577#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {42967#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {43006#(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:19,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {43006#(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); {42965#true} is VALID [2022-02-20 19:58:19,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {42965#true} assume !(0 == ~q_write_ev~0); {42965#true} is VALID [2022-02-20 19:58:19,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,339 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1579#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,339 INFO L272 TraceCheckUtils]: 17: Hoare triple {42967#(= ~p_dw_pc~0 0)} call activate_threads1(); {43007#(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:19,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {43007#(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; {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L272 TraceCheckUtils]: 19: Hoare triple {42965#true} call #t~ret8 := is_do_write_p_triggered(); {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {42965#true} havoc ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {42965#true} assume !(1 == ~p_dw_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {42965#true} ~__retres1~0 := 0; {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {42965#true} #res := ~__retres1~0; {42965#true} is VALID [2022-02-20 19:58:19,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {42965#true} {42965#true} #1573#return; {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {42965#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {42965#true} assume !(0 != ~tmp~1); {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L272 TraceCheckUtils]: 28: Hoare triple {42965#true} call #t~ret9 := is_do_read_c_triggered(); {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {42965#true} havoc ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {42965#true} assume !(1 == ~c_dr_pc~0); {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {42965#true} ~__retres1~1 := 0; {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {42965#true} #res := ~__retres1~1; {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {42965#true} {42965#true} #1575#return; {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {42965#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42965#true} is VALID [2022-02-20 19:58:19,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {42965#true} assume !(0 != ~tmp___0~1); {42965#true} is VALID [2022-02-20 19:58:19,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,343 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1581#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,344 INFO L272 TraceCheckUtils]: 39: Hoare triple {42967#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {43006#(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:19,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {43006#(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); {42965#true} is VALID [2022-02-20 19:58:19,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {42965#true} assume !(1 == ~q_write_ev~0); {42965#true} is VALID [2022-02-20 19:58:19,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,344 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1583#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume !false; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {42967#(= ~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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume !false; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,346 INFO L272 TraceCheckUtils]: 47: Hoare triple {42967#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42965#true} is VALID [2022-02-20 19:58:19,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {42965#true} havoc ~__retres1~2; {42965#true} is VALID [2022-02-20 19:58:19,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {42965#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42965#true} is VALID [2022-02-20 19:58:19,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {42965#true} #res := ~__retres1~2; {42965#true} is VALID [2022-02-20 19:58:19,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {42965#true} assume true; {42965#true} is VALID [2022-02-20 19:58:19,347 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {42965#true} {42967#(= ~p_dw_pc~0 0)} #1585#return; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {42967#(= ~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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {42967#(= ~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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {42967#(= ~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; {42967#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {42967#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {42966#false} is VALID [2022-02-20 19:58:19,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {42966#false} assume 1 == ~p_dw_pc~0; {42966#false} is VALID [2022-02-20 19:58:19,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {42966#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; {42966#false} is VALID [2022-02-20 19:58:19,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {42966#false} assume !false; {42966#false} is VALID [2022-02-20 19:58:19,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {42966#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {42966#false} assume { :end_inline_do_write_p } true; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {42966#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; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {42966#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; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {42966#false} assume 0 == ~c_dr_pc~0; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 66: Hoare triple {42966#false} assume !false; {42966#false} is VALID [2022-02-20 19:58:19,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {42966#false} assume !(1 == ~q_free~0); {42966#false} is VALID [2022-02-20 19:58:19,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {42966#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; {42966#false} is VALID [2022-02-20 19:58:19,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {42966#false} assume !(~p_last_write~0 == ~c_last_read~0); {42966#false} is VALID [2022-02-20 19:58:19,351 INFO L272 TraceCheckUtils]: 70: Hoare triple {42966#false} call error1(); {42966#false} is VALID [2022-02-20 19:58:19,351 INFO L290 TraceCheckUtils]: 71: Hoare triple {42966#false} assume !false; {42966#false} is VALID [2022-02-20 19:58:19,351 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:19,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555266321] [2022-02-20 19:58:19,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555266321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:19,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:19,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:19,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516799961] [2022-02-20 19:58:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:19,353 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:19,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:19,354 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:19,399 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:19,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:19,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:19,400 INFO L87 Difference]: Start difference. First operand 2262 states and 2948 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:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:22,058 INFO L93 Difference]: Finished difference Result 5172 states and 6598 transitions. [2022-02-20 19:58:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:22,059 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:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:22,059 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:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 880 transitions. [2022-02-20 19:58:22,064 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:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 880 transitions. [2022-02-20 19:58:22,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 880 transitions. [2022-02-20 19:58:22,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:23,173 INFO L225 Difference]: With dead ends: 5172 [2022-02-20 19:58:23,173 INFO L226 Difference]: Without dead ends: 3242 [2022-02-20 19:58:23,177 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:23,177 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 1454 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:23,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1238 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2022-02-20 19:58:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2994. [2022-02-20 19:58:23,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:23,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3242 states. Second operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:23,408 INFO L74 IsIncluded]: Start isIncluded. First operand 3242 states. Second operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:23,413 INFO L87 Difference]: Start difference. First operand 3242 states. Second operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:23,748 INFO L93 Difference]: Finished difference Result 3242 states and 4122 transitions. [2022-02-20 19:58:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4122 transitions. [2022-02-20 19:58:23,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:23,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:23,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) Second operand 3242 states. [2022-02-20 19:58:23,764 INFO L87 Difference]: Start difference. First operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) Second operand 3242 states. [2022-02-20 19:58:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,138 INFO L93 Difference]: Finished difference Result 3242 states and 4122 transitions. [2022-02-20 19:58:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4122 transitions. [2022-02-20 19:58:24,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:24,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2366 states have (on average 1.2992392223161453) internal successors, (3074), 2403 states have internal predecessors, (3074), 320 states have call successors, (320), 250 states have call predecessors, (320), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 3841 transitions. [2022-02-20 19:58:24,672 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 3841 transitions. Word has length 72 [2022-02-20 19:58:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:24,672 INFO L470 AbstractCegarLoop]: Abstraction has 2994 states and 3841 transitions. [2022-02-20 19:58:24,673 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:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3841 transitions. [2022-02-20 19:58:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:24,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:24,675 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:24,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:24,675 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash -191825039, now seen corresponding path program 1 times [2022-02-20 19:58:24,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431852509] [2022-02-20 19:58:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {60485#(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); {60444#true} is VALID [2022-02-20 19:58:24,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60444#true} {60444#true} #1577#return; {60444#true} is VALID [2022-02-20 19:58:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {60486#(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); {60444#true} is VALID [2022-02-20 19:58:24,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume !(0 == ~q_write_ev~0); {60444#true} is VALID [2022-02-20 19:58:24,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60444#true} {60444#true} #1579#return; {60444#true} is VALID [2022-02-20 19:58:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {60444#true} havoc ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume !(1 == ~p_dw_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} ~__retres1~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {60444#true} #res := ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,757 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {60444#true} {60444#true} #1573#return; {60444#true} is VALID [2022-02-20 19:58:24,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {60444#true} havoc ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume !(1 == ~c_dr_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} ~__retres1~1 := 0; {60444#true} is VALID [2022-02-20 19:58:24,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {60444#true} #res := ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {60444#true} {60444#true} #1575#return; {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {60487#(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; {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L272 TraceCheckUtils]: 1: Hoare triple {60444#true} call #t~ret8 := is_do_write_p_triggered(); {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} havoc ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {60444#true} assume !(1 == ~p_dw_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {60444#true} ~__retres1~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {60444#true} #res := ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60444#true} {60444#true} #1573#return; {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {60444#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {60444#true} assume !(0 != ~tmp~1); {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L272 TraceCheckUtils]: 10: Hoare triple {60444#true} call #t~ret9 := is_do_read_c_triggered(); {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {60444#true} havoc ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {60444#true} assume !(1 == ~c_dr_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {60444#true} ~__retres1~1 := 0; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {60444#true} #res := ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60444#true} {60444#true} #1575#return; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {60444#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {60444#true} assume !(0 != ~tmp___0~1); {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,762 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {60444#true} {60444#true} #1581#return; {60444#true} is VALID [2022-02-20 19:58:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {60486#(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); {60444#true} is VALID [2022-02-20 19:58:24,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume !(1 == ~q_write_ev~0); {60444#true} is VALID [2022-02-20 19:58:24,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60444#true} {60444#true} #1583#return; {60444#true} is VALID [2022-02-20 19:58:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {60444#true} havoc ~__retres1~2; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} #res := ~__retres1~2; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60444#true} {60444#true} #1585#return; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {60444#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {60444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {60444#true} is VALID [2022-02-20 19:58:24,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {60444#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {60444#true} is VALID [2022-02-20 19:58:24,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {60444#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; {60444#true} is VALID [2022-02-20 19:58:24,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {60444#true} call update_channels1(); {60485#(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,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {60485#(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); {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60444#true} {60444#true} #1577#return; {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {60444#true} assume { :begin_inline_init_threads1 } true; {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {60444#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {60444#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {60444#true} assume { :end_inline_init_threads1 } true; {60444#true} is VALID [2022-02-20 19:58:24,774 INFO L272 TraceCheckUtils]: 12: Hoare triple {60444#true} call fire_delta_events1(); {60486#(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,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {60486#(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); {60444#true} is VALID [2022-02-20 19:58:24,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {60444#true} assume !(0 == ~q_write_ev~0); {60444#true} is VALID [2022-02-20 19:58:24,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,774 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60444#true} {60444#true} #1579#return; {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L272 TraceCheckUtils]: 17: Hoare triple {60444#true} call activate_threads1(); {60487#(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,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {60487#(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; {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {60444#true} call #t~ret8 := is_do_write_p_triggered(); {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {60444#true} havoc ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {60444#true} assume !(1 == ~p_dw_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {60444#true} ~__retres1~0 := 0; {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {60444#true} #res := ~__retres1~0; {60444#true} is VALID [2022-02-20 19:58:24,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {60444#true} {60444#true} #1573#return; {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {60444#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {60444#true} assume !(0 != ~tmp~1); {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L272 TraceCheckUtils]: 28: Hoare triple {60444#true} call #t~ret9 := is_do_read_c_triggered(); {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {60444#true} havoc ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {60444#true} assume !(1 == ~c_dr_pc~0); {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {60444#true} ~__retres1~1 := 0; {60444#true} is VALID [2022-02-20 19:58:24,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {60444#true} #res := ~__retres1~1; {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {60444#true} {60444#true} #1575#return; {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {60444#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {60444#true} assume !(0 != ~tmp___0~1); {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,777 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {60444#true} {60444#true} #1581#return; {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L272 TraceCheckUtils]: 39: Hoare triple {60444#true} call reset_delta_events1(); {60486#(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,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {60486#(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); {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {60444#true} assume !(1 == ~q_write_ev~0); {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {60444#true} {60444#true} #1583#return; {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {60444#true} assume !false; {60444#true} is VALID [2022-02-20 19:58:24,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {60444#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; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {60444#true} assume !false; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L272 TraceCheckUtils]: 47: Hoare triple {60444#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {60444#true} havoc ~__retres1~2; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {60444#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {60444#true} #res := ~__retres1~2; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {60444#true} assume true; {60444#true} is VALID [2022-02-20 19:58:24,779 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {60444#true} {60444#true} #1585#return; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {60444#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; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {60444#true} assume 0 != eval1_~tmp___1~0#1; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {60444#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; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {60444#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; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {60444#true} assume 0 == ~p_dw_pc~0; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {60444#true} assume !false; {60444#true} is VALID [2022-02-20 19:58:24,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {60444#true} assume !(0 == ~q_free~0); {60444#true} is VALID [2022-02-20 19:58:24,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {60444#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; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {60483#(= ~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; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {60483#(= ~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; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {60483#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {60483#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {60483#(= ~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; {60484#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:24,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {60484#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {60445#false} is VALID [2022-02-20 19:58:24,785 INFO L272 TraceCheckUtils]: 71: Hoare triple {60445#false} call error1(); {60445#false} is VALID [2022-02-20 19:58:24,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {60445#false} assume !false; {60445#false} is VALID [2022-02-20 19:58:24,785 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:24,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:24,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431852509] [2022-02-20 19:58:24,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431852509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:24,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:24,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:24,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876555276] [2022-02-20 19:58:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:24,787 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:24,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:24,787 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:24,837 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:24,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:24,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:24,839 INFO L87 Difference]: Start difference. First operand 2994 states and 3841 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:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,716 INFO L93 Difference]: Finished difference Result 3768 states and 4772 transitions. [2022-02-20 19:58:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:27,716 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:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:27,717 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:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 763 transitions. [2022-02-20 19:58:27,721 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:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 763 transitions. [2022-02-20 19:58:27,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 763 transitions. [2022-02-20 19:58:28,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:28,859 INFO L225 Difference]: With dead ends: 3768 [2022-02-20 19:58:28,859 INFO L226 Difference]: Without dead ends: 3765 [2022-02-20 19:58:28,860 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:28,861 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 1759 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:28,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 1501 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:58:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-02-20 19:58:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3488. [2022-02-20 19:58:29,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:29,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3765 states. Second operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:29,131 INFO L74 IsIncluded]: Start isIncluded. First operand 3765 states. Second operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:29,136 INFO L87 Difference]: Start difference. First operand 3765 states. Second operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,714 INFO L93 Difference]: Finished difference Result 3765 states and 4758 transitions. [2022-02-20 19:58:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 4758 transitions. [2022-02-20 19:58:29,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:29,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:29,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) Second operand 3765 states. [2022-02-20 19:58:29,734 INFO L87 Difference]: Start difference. First operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) Second operand 3765 states. [2022-02-20 19:58:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,179 INFO L93 Difference]: Finished difference Result 3765 states and 4758 transitions. [2022-02-20 19:58:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 4758 transitions. [2022-02-20 19:58:30,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:30,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:30,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:30,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2751 states have (on average 1.2889858233369684) internal successors, (3546), 2793 states have internal predecessors, (3546), 370 states have call successors, (370), 294 states have call predecessors, (370), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4442 transitions. [2022-02-20 19:58:30,943 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4442 transitions. Word has length 73 [2022-02-20 19:58:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:30,943 INFO L470 AbstractCegarLoop]: Abstraction has 3488 states and 4442 transitions. [2022-02-20 19:58:30,943 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:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4442 transitions. [2022-02-20 19:58:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:30,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:30,946 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:30,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:30,946 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1652850327, now seen corresponding path program 1 times [2022-02-20 19:58:30,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:30,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879657690] [2022-02-20 19:58:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {77778#(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); {77736#true} is VALID [2022-02-20 19:58:31,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1577#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {77779#(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); {77736#true} is VALID [2022-02-20 19:58:31,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume !(0 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:31,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1579#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#true} havoc ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume !(1 == ~p_dw_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} ~__retres1~0 := 0; {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {77736#true} #res := ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77736#true} {77736#true} #1573#return; {77736#true} is VALID [2022-02-20 19:58:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#true} havoc ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume !(1 == ~c_dr_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} ~__retres1~1 := 0; {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {77736#true} #res := ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77736#true} {77736#true} #1575#return; {77736#true} is VALID [2022-02-20 19:58:31,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {77780#(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; {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L272 TraceCheckUtils]: 1: Hoare triple {77736#true} call #t~ret8 := is_do_write_p_triggered(); {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} havoc ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {77736#true} assume !(1 == ~p_dw_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {77736#true} ~__retres1~0 := 0; {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {77736#true} #res := ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,077 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77736#true} {77736#true} #1573#return; {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {77736#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {77736#true} assume !(0 != ~tmp~1); {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L272 TraceCheckUtils]: 10: Hoare triple {77736#true} call #t~ret9 := is_do_read_c_triggered(); {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {77736#true} havoc ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {77736#true} assume !(1 == ~c_dr_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {77736#true} ~__retres1~1 := 0; {77736#true} is VALID [2022-02-20 19:58:31,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {77736#true} #res := ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,079 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77736#true} {77736#true} #1575#return; {77736#true} is VALID [2022-02-20 19:58:31,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {77736#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77736#true} is VALID [2022-02-20 19:58:31,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {77736#true} assume !(0 != ~tmp___0~1); {77736#true} is VALID [2022-02-20 19:58:31,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,080 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1581#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {77779#(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); {77736#true} is VALID [2022-02-20 19:58:31,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume !(1 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:31,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1583#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#true} havoc ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:31,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77736#true} is VALID [2022-02-20 19:58:31,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} #res := ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:31,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,093 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1585#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {77736#true} is VALID [2022-02-20 19:58:31,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {77736#true} is VALID [2022-02-20 19:58:31,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {77778#(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:31,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {77778#(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); {77736#true} is VALID [2022-02-20 19:58:31,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,095 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1577#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {77779#(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:31,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {77779#(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); {77736#true} is VALID [2022-02-20 19:58:31,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {77736#true} assume !(0 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:31,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,098 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1579#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,099 INFO L272 TraceCheckUtils]: 17: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {77780#(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:31,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {77780#(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; {77736#true} is VALID [2022-02-20 19:58:31,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {77736#true} call #t~ret8 := is_do_write_p_triggered(); {77736#true} is VALID [2022-02-20 19:58:31,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {77736#true} havoc ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {77736#true} assume !(1 == ~p_dw_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {77736#true} ~__retres1~0 := 0; {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {77736#true} #res := ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77736#true} {77736#true} #1573#return; {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {77736#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {77736#true} assume !(0 != ~tmp~1); {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L272 TraceCheckUtils]: 28: Hoare triple {77736#true} call #t~ret9 := is_do_read_c_triggered(); {77736#true} is VALID [2022-02-20 19:58:31,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {77736#true} havoc ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {77736#true} assume !(1 == ~c_dr_pc~0); {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {77736#true} ~__retres1~1 := 0; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {77736#true} #res := ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77736#true} {77736#true} #1575#return; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {77736#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77736#true} is VALID [2022-02-20 19:58:31,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {77736#true} assume !(0 != ~tmp___0~1); {77736#true} is VALID [2022-02-20 19:58:31,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,102 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1581#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,103 INFO L272 TraceCheckUtils]: 39: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {77779#(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:31,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {77779#(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); {77736#true} is VALID [2022-02-20 19:58:31,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {77736#true} assume !(1 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:31,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,103 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1583#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,105 INFO L272 TraceCheckUtils]: 47: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {77736#true} is VALID [2022-02-20 19:58:31,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {77736#true} havoc ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:31,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {77736#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77736#true} is VALID [2022-02-20 19:58:31,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {77736#true} #res := ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:31,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:31,106 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77736#true} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1585#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {77738#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {77776#(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; {77777#(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:31,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {77777#(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; {77777#(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:31,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {77777#(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); {77737#false} is VALID [2022-02-20 19:58:31,114 INFO L272 TraceCheckUtils]: 72: Hoare triple {77737#false} call error1(); {77737#false} is VALID [2022-02-20 19:58:31,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {77737#false} assume !false; {77737#false} is VALID [2022-02-20 19:58:31,115 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:31,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:31,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879657690] [2022-02-20 19:58:31,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879657690] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:31,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180929356] [2022-02-20 19:58:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:31,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:31,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:31,118 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:31,162 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:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:32,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {77736#true} is VALID [2022-02-20 19:58:32,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {77736#true} is VALID [2022-02-20 19:58:32,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,008 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1577#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,012 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1579#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,013 INFO L272 TraceCheckUtils]: 19: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,022 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1573#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,023 INFO L272 TraceCheckUtils]: 28: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,026 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1575#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,028 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1581#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,029 INFO L272 TraceCheckUtils]: 39: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,030 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1583#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,032 INFO L272 TraceCheckUtils]: 47: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,034 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1585#return; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {77738#(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; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {77738#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {77738#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,048 INFO L290 TraceCheckUtils]: 65: Hoare triple {77776#(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; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,049 INFO L290 TraceCheckUtils]: 67: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {77776#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {77776#(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; {78003#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {78003#(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; {78003#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:32,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {78003#(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); {77737#false} is VALID [2022-02-20 19:58:32,051 INFO L272 TraceCheckUtils]: 72: Hoare triple {77737#false} call error1(); {77737#false} is VALID [2022-02-20 19:58:32,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {77737#false} assume !false; {77737#false} is VALID [2022-02-20 19:58:32,052 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:32,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:32,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {77737#false} assume !false; {77737#false} is VALID [2022-02-20 19:58:32,492 INFO L272 TraceCheckUtils]: 72: Hoare triple {77737#false} call error1(); {77737#false} is VALID [2022-02-20 19:58:32,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {77777#(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); {77737#false} is VALID [2022-02-20 19:58:32,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {77777#(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; {77777#(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:32,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {78028#(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; {77777#(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:32,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {78028#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {78028#(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:32,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {78028#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {78028#(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:32,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {78028#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {78028#(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:32,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {78028#(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; {78028#(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:32,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {78028#(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; {78028#(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:32,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {78028#(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; {78028#(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:32,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {78028#(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; {78028#(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:32,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {78028#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {78028#(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:32,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {77777#(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; {78028#(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:32,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {77777#(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:32,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77777#(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:32,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {77777#(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:32,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {77777#(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; {77777#(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:32,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {77777#(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; {77777#(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:32,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {77777#(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; {77777#(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:32,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {77777#(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; {77777#(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:32,502 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77736#true} {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1585#return; {77777#(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:32,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {77736#true} #res := ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:32,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {77736#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77736#true} is VALID [2022-02-20 19:58:32,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {77736#true} havoc ~__retres1~2; {77736#true} is VALID [2022-02-20 19:58:32,503 INFO L272 TraceCheckUtils]: 47: Hoare triple {77777#(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(); {77736#true} is VALID [2022-02-20 19:58:32,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77777#(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:32,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {77777#(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; {77777#(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:32,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77777#(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:32,505 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77736#true} {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1583#return; {77777#(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:32,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {77736#true} assume !(1 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:32,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {77736#true} assume !(1 == ~q_read_ev~0); {77736#true} is VALID [2022-02-20 19:58:32,506 INFO L272 TraceCheckUtils]: 39: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {77736#true} is VALID [2022-02-20 19:58:32,506 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77736#true} {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1581#return; {77777#(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:32,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {77736#true} assume !(0 != ~tmp___0~1); {77736#true} is VALID [2022-02-20 19:58:32,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {77736#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77736#true} {77736#true} #1575#return; {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {77736#true} #res := ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {77736#true} ~__retres1~1 := 0; {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {77736#true} assume !(1 == ~c_dr_pc~0); {77736#true} is VALID [2022-02-20 19:58:32,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {77736#true} havoc ~__retres1~1; {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {77736#true} call #t~ret9 := is_do_read_c_triggered(); {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {77736#true} assume !(0 != ~tmp~1); {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {77736#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77736#true} {77736#true} #1573#return; {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {77736#true} #res := ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {77736#true} ~__retres1~0 := 0; {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {77736#true} assume !(1 == ~p_dw_pc~0); {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {77736#true} havoc ~__retres1~0; {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L272 TraceCheckUtils]: 19: Hoare triple {77736#true} call #t~ret8 := is_do_write_p_triggered(); {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {77736#true} havoc ~tmp~1;havoc ~tmp___0~1; {77736#true} is VALID [2022-02-20 19:58:32,509 INFO L272 TraceCheckUtils]: 17: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {77736#true} is VALID [2022-02-20 19:58:32,510 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77736#true} {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1579#return; {77777#(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:32,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {77736#true} assume !(0 == ~q_write_ev~0); {77736#true} is VALID [2022-02-20 19:58:32,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {77736#true} assume !(0 == ~q_read_ev~0); {77736#true} is VALID [2022-02-20 19:58:32,523 INFO L272 TraceCheckUtils]: 12: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {77736#true} is VALID [2022-02-20 19:58:32,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {77777#(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:32,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {77777#(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; {77777#(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:32,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {77777#(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; {77777#(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:32,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {77777#(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:32,526 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77736#true} {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1577#return; {77777#(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:32,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {77736#true} assume true; {77736#true} is VALID [2022-02-20 19:58:32,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {77736#true} assume !(1 == ~q_req_up~0); {77736#true} is VALID [2022-02-20 19:58:32,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {77777#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {77736#true} is VALID [2022-02-20 19:58:32,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {77777#(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; {77777#(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:32,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {77736#true} assume 0 != main_#t~nondet45#1;havoc main_#t~nondet45#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; {77777#(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:32,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {77736#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1;assume -2147483648 <= main_#t~nondet45#1 && main_#t~nondet45#1 <= 2147483647; {77736#true} is VALID [2022-02-20 19:58:32,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {77736#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {77736#true} is VALID [2022-02-20 19:58:32,528 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:32,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180929356] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:32,528 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:32,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:32,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490425775] [2022-02-20 19:58:32,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,530 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:32,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,533 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:32,644 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:32,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:32,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:32,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:32,645 INFO L87 Difference]: Start difference. First operand 3488 states and 4442 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)