./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.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.02.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 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:38,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:38,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:38,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:38,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:38,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:38,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:38,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:38,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:38,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:38,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:38,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:38,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:38,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:38,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:38,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:38,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:38,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:38,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:38,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:38,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:38,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:38,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:38,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:38,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:38,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:38,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:38,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:38,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:38,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:38,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:38,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:38,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:38,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:38,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:38,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:38,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:38,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:38,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:38,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:38,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:38,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:56:38,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:38,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:38,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:38,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:38,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:38,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:38,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:38,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:38,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:38,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:38,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:38,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:38,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:38,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:38,718 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:38,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:38,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:38,718 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 -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2022-02-20 19:56:38,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:38,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:38,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:38,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:38,937 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:38,938 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.02.cil-2.c [2022-02-20 19:56:38,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebfae6d/ce0399f7b8674a13a81af6b514207308/FLAG614abb030 [2022-02-20 19:56:39,359 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:39,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-02-20 19:56:39,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebfae6d/ce0399f7b8674a13a81af6b514207308/FLAG614abb030 [2022-02-20 19:56:39,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ebfae6d/ce0399f7b8674a13a81af6b514207308 [2022-02-20 19:56:39,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:39,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:39,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:39,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:39,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:39,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:39" (1/1) ... [2022-02-20 19:56:39,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6f6cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:39, skipping insertion in model container [2022-02-20 19:56:39,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:39" (1/1) ... [2022-02-20 19:56:39,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:39,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:39,925 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.02.cil-2.c[914,927] [2022-02-20 19:56:39,958 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.02.cil-2.c[7115,7128] [2022-02-20 19:56:39,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:39,990 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:40,004 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.02.cil-2.c[914,927] [2022-02-20 19:56:40,025 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.02.cil-2.c[7115,7128] [2022-02-20 19:56:40,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:40,070 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:40,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40 WrapperNode [2022-02-20 19:56:40,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:40,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:40,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:40,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:40,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,117 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2022-02-20 19:56:40,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:40,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:40,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:40,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:40,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:40,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:40,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:40,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:40,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (1/1) ... [2022-02-20 19:56:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:40,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:56:40,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:56:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:40,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:40,237 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:40,237 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:40,237 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:40,238 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:40,238 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:40,238 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:40,238 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:40,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:40,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:40,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:40,239 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:56:40,240 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:56:40,302 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:40,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:40,712 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:40,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:40,731 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:56:40,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:40 BoogieIcfgContainer [2022-02-20 19:56:40,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:40,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:40,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:40,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:40,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:39" (1/3) ... [2022-02-20 19:56:40,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3220f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:40, skipping insertion in model container [2022-02-20 19:56:40,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:40" (2/3) ... [2022-02-20 19:56:40,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3220f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:40, skipping insertion in model container [2022-02-20 19:56:40,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:40" (3/3) ... [2022-02-20 19:56:40,753 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-02-20 19:56:40,756 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:40,757 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:40,787 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:40,792 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:56:40,792 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 19:56:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:40,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:40,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:40,828 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2022-02-20 19:56:40,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:40,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789335076] [2022-02-20 19:56:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {284#(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); {244#true} is VALID [2022-02-20 19:56:40,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:40,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {244#true} {246#(= ~p_dw_i~0 1)} #793#return; {246#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(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; {244#true} is VALID [2022-02-20 19:56:40,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume !(0 == ~q_write_ev~0); {244#true} is VALID [2022-02-20 19:56:40,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:40,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {245#false} #795#return; {245#false} is VALID [2022-02-20 19:56:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} havoc ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume !(1 == ~p_dw_pc~0); {244#true} is VALID [2022-02-20 19:56:41,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} ~__retres1~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {244#true} #res := ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,020 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {244#true} {244#true} #789#return; {244#true} is VALID [2022-02-20 19:56:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} havoc ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume 1 == ~c_dr_pc~0; {244#true} is VALID [2022-02-20 19:56:41,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {244#true} is VALID [2022-02-20 19:56:41,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {244#true} #res := ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,026 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {244#true} {244#true} #791#return; {244#true} is VALID [2022-02-20 19:56:41,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#(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; {244#true} is VALID [2022-02-20 19:56:41,026 INFO L272 TraceCheckUtils]: 1: Hoare triple {244#true} call #t~ret8 := is_do_write_p_triggered(); {244#true} is VALID [2022-02-20 19:56:41,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} havoc ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {244#true} assume !(1 == ~p_dw_pc~0); {244#true} is VALID [2022-02-20 19:56:41,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#true} ~__retres1~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} #res := ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,027 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {244#true} {244#true} #789#return; {244#true} is VALID [2022-02-20 19:56:41,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {244#true} is VALID [2022-02-20 19:56:41,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,028 INFO L272 TraceCheckUtils]: 10: Hoare triple {244#true} call #t~ret9 := is_do_read_c_triggered(); {244#true} is VALID [2022-02-20 19:56:41,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#true} havoc ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#true} assume 1 == ~c_dr_pc~0; {244#true} is VALID [2022-02-20 19:56:41,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {244#true} is VALID [2022-02-20 19:56:41,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} #res := ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,029 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {244#true} {244#true} #791#return; {244#true} is VALID [2022-02-20 19:56:41,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {244#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {244#true} is VALID [2022-02-20 19:56:41,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {244#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,030 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {244#true} {245#false} #797#return; {245#false} is VALID [2022-02-20 19:56:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(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); {244#true} is VALID [2022-02-20 19:56:41,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {244#true} is VALID [2022-02-20 19:56:41,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {245#false} #799#return; {245#false} is VALID [2022-02-20 19:56:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:41,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} havoc ~__retres1~2; {244#true} is VALID [2022-02-20 19:56:41,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {244#true} is VALID [2022-02-20 19:56:41,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} #res := ~__retres1~2; {244#true} is VALID [2022-02-20 19:56:41,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,042 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {244#true} {245#false} #801#return; {245#false} is VALID [2022-02-20 19:56:41,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {244#true} is VALID [2022-02-20 19:56:41,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {246#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#(= ~p_dw_i~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; {246#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#(= ~p_dw_i~0 1)} call update_channels1(); {284#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:41,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(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); {244#true} is VALID [2022-02-20 19:56:41,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,045 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {244#true} {246#(= ~p_dw_i~0 1)} #793#return; {246#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {246#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:56:41,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {245#false} is VALID [2022-02-20 19:56:41,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {245#false} is VALID [2022-02-20 19:56:41,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#false} assume { :end_inline_init_threads1 } true; {245#false} is VALID [2022-02-20 19:56:41,046 INFO L272 TraceCheckUtils]: 12: Hoare triple {245#false} call fire_delta_events1(); {285#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:41,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(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; {244#true} is VALID [2022-02-20 19:56:41,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} assume !(0 == ~q_write_ev~0); {244#true} is VALID [2022-02-20 19:56:41,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {244#true} {245#false} #795#return; {245#false} is VALID [2022-02-20 19:56:41,047 INFO L272 TraceCheckUtils]: 17: Hoare triple {245#false} call activate_threads1(); {286#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:41,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {286#(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; {244#true} is VALID [2022-02-20 19:56:41,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {244#true} call #t~ret8 := is_do_write_p_triggered(); {244#true} is VALID [2022-02-20 19:56:41,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {244#true} havoc ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {244#true} assume !(1 == ~p_dw_pc~0); {244#true} is VALID [2022-02-20 19:56:41,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {244#true} ~__retres1~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {244#true} #res := ~__retres1~0; {244#true} is VALID [2022-02-20 19:56:41,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,049 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {244#true} {244#true} #789#return; {244#true} is VALID [2022-02-20 19:56:41,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {244#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {244#true} is VALID [2022-02-20 19:56:41,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {244#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,049 INFO L272 TraceCheckUtils]: 28: Hoare triple {244#true} call #t~ret9 := is_do_read_c_triggered(); {244#true} is VALID [2022-02-20 19:56:41,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {244#true} havoc ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {244#true} assume 1 == ~c_dr_pc~0; {244#true} is VALID [2022-02-20 19:56:41,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {244#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {244#true} is VALID [2022-02-20 19:56:41,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {244#true} #res := ~__retres1~1; {244#true} is VALID [2022-02-20 19:56:41,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,050 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {244#true} {244#true} #791#return; {244#true} is VALID [2022-02-20 19:56:41,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {244#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {244#true} is VALID [2022-02-20 19:56:41,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {244#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {244#true} is VALID [2022-02-20 19:56:41,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,051 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {244#true} {245#false} #797#return; {245#false} is VALID [2022-02-20 19:56:41,051 INFO L272 TraceCheckUtils]: 39: Hoare triple {245#false} call reset_delta_events1(); {285#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:41,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {285#(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); {244#true} is VALID [2022-02-20 19:56:41,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {244#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {244#true} is VALID [2022-02-20 19:56:41,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,052 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {244#true} {245#false} #799#return; {245#false} is VALID [2022-02-20 19:56:41,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 19:56:41,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {245#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; {245#false} is VALID [2022-02-20 19:56:41,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 19:56:41,053 INFO L272 TraceCheckUtils]: 47: Hoare triple {245#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {244#true} is VALID [2022-02-20 19:56:41,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {244#true} havoc ~__retres1~2; {244#true} is VALID [2022-02-20 19:56:41,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {244#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {244#true} is VALID [2022-02-20 19:56:41,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {244#true} #res := ~__retres1~2; {244#true} is VALID [2022-02-20 19:56:41,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {244#true} assume true; {244#true} is VALID [2022-02-20 19:56:41,054 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {244#true} {245#false} #801#return; {245#false} is VALID [2022-02-20 19:56:41,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {245#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; {245#false} is VALID [2022-02-20 19:56:41,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {245#false} assume 0 != eval1_~tmp___1~0#1; {245#false} is VALID [2022-02-20 19:56:41,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {245#false} assume !(0 == ~p_dw_st~0); {245#false} is VALID [2022-02-20 19:56:41,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {245#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; {245#false} is VALID [2022-02-20 19:56:41,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {245#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; {245#false} is VALID [2022-02-20 19:56:41,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {245#false} assume 0 == ~c_dr_pc~0; {245#false} is VALID [2022-02-20 19:56:41,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 19:56:41,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {245#false} assume !(1 == ~q_free~0); {245#false} is VALID [2022-02-20 19:56:41,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {245#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; {245#false} is VALID [2022-02-20 19:56:41,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {245#false} assume !(~p_last_write~0 == ~c_last_read~0); {245#false} is VALID [2022-02-20 19:56:41,056 INFO L272 TraceCheckUtils]: 63: Hoare triple {245#false} call error1(); {245#false} is VALID [2022-02-20 19:56:41,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 19:56:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:41,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:41,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789335076] [2022-02-20 19:56:41,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789335076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:41,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:41,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:56:41,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535435450] [2022-02-20 19:56:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:41,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:41,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:41,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:41,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:41,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:56:41,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:56:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:56:41,130 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,198 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2022-02-20 19:56:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:56:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 727 transitions. [2022-02-20 19:56:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 727 transitions. [2022-02-20 19:56:42,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 727 transitions. [2022-02-20 19:56:42,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:42,704 INFO L225 Difference]: With dead ends: 482 [2022-02-20 19:56:42,705 INFO L226 Difference]: Without dead ends: 248 [2022-02-20 19:56:42,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:56:42,710 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 351 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:42,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 897 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:56:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-02-20 19:56:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2022-02-20 19:56:42,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:42,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:42,744 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:42,745 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,755 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2022-02-20 19:56:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 356 transitions. [2022-02-20 19:56:42,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:42,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:42,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 248 states. [2022-02-20 19:56:42,759 INFO L87 Difference]: Start difference. First operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 248 states. [2022-02-20 19:56:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,768 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2022-02-20 19:56:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 356 transitions. [2022-02-20 19:56:42,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:42,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:42,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:42,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:56:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2022-02-20 19:56:42,779 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2022-02-20 19:56:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:42,779 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2022-02-20 19:56:42,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2022-02-20 19:56:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:42,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:42,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:42,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:42,782 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2022-02-20 19:56:42,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:42,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697684881] [2022-02-20 19:56:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {1829#(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); {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:42,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:42,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1791#(= ~q_read_ev~0 2)} #793#return; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {1831#(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; {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1832#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1832#(= |old(~q_read_ev~0)| 0)} assume true; {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1832#(= |old(~q_read_ev~0)| 0)} {1791#(= ~q_read_ev~0 2)} #795#return; {1790#false} is VALID [2022-02-20 19:56:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} havoc ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume !(1 == ~p_dw_pc~0); {1789#true} is VALID [2022-02-20 19:56:42,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} ~__retres1~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {1789#true} #res := ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,906 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1789#true} {1789#true} #789#return; {1789#true} is VALID [2022-02-20 19:56:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} havoc ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume 1 == ~c_dr_pc~0; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {1789#true} #res := ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1789#true} {1789#true} #791#return; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1833#(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; {1789#true} is VALID [2022-02-20 19:56:42,910 INFO L272 TraceCheckUtils]: 1: Hoare triple {1789#true} call #t~ret8 := is_do_write_p_triggered(); {1789#true} is VALID [2022-02-20 19:56:42,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} havoc ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {1789#true} assume !(1 == ~p_dw_pc~0); {1789#true} is VALID [2022-02-20 19:56:42,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {1789#true} ~__retres1~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {1789#true} #res := ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1789#true} {1789#true} #789#return; {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1789#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L272 TraceCheckUtils]: 10: Hoare triple {1789#true} call #t~ret9 := is_do_read_c_triggered(); {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {1789#true} havoc ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {1789#true} assume 1 == ~c_dr_pc~0; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {1789#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1789#true} #res := ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1789#true} {1789#true} #791#return; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {1789#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1789#true} is VALID [2022-02-20 19:56:42,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,914 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1789#true} {1790#false} #797#return; {1790#false} is VALID [2022-02-20 19:56:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {1831#(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); {1789#true} is VALID [2022-02-20 19:56:42,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1789#true} is VALID [2022-02-20 19:56:42,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1789#true} {1790#false} #799#return; {1790#false} is VALID [2022-02-20 19:56:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} havoc ~__retres1~2; {1789#true} is VALID [2022-02-20 19:56:42,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1789#true} is VALID [2022-02-20 19:56:42,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} #res := ~__retres1~2; {1789#true} is VALID [2022-02-20 19:56:42,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,923 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1789#true} {1790#false} #801#return; {1790#false} is VALID [2022-02-20 19:56:42,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {1789#true} is VALID [2022-02-20 19:56:42,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {1791#(= ~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; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1791#(= ~q_read_ev~0 2)} call update_channels1(); {1829#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:42,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#(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); {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:42,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:42,926 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1830#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1791#(= ~q_read_ev~0 2)} #793#return; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {1791#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {1791#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {1791#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {1791#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {1791#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:42,928 INFO L272 TraceCheckUtils]: 12: Hoare triple {1791#(= ~q_read_ev~0 2)} call fire_delta_events1(); {1831#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:42,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {1831#(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; {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1832#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {1832#(= |old(~q_read_ev~0)| 0)} assume true; {1832#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:42,929 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1832#(= |old(~q_read_ev~0)| 0)} {1791#(= ~q_read_ev~0 2)} #795#return; {1790#false} is VALID [2022-02-20 19:56:42,929 INFO L272 TraceCheckUtils]: 17: Hoare triple {1790#false} call activate_threads1(); {1833#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:42,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {1833#(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; {1789#true} is VALID [2022-02-20 19:56:42,929 INFO L272 TraceCheckUtils]: 19: Hoare triple {1789#true} call #t~ret8 := is_do_write_p_triggered(); {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {1789#true} havoc ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {1789#true} assume !(1 == ~p_dw_pc~0); {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {1789#true} ~__retres1~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {1789#true} #res := ~__retres1~0; {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,930 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1789#true} {1789#true} #789#return; {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {1789#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {1789#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L272 TraceCheckUtils]: 28: Hoare triple {1789#true} call #t~ret9 := is_do_read_c_triggered(); {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {1789#true} havoc ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {1789#true} assume 1 == ~c_dr_pc~0; {1789#true} is VALID [2022-02-20 19:56:42,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {1789#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {1789#true} #res := ~__retres1~1; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1789#true} {1789#true} #791#return; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {1789#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {1789#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1789#true} is VALID [2022-02-20 19:56:42,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,933 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1789#true} {1790#false} #797#return; {1790#false} is VALID [2022-02-20 19:56:42,933 INFO L272 TraceCheckUtils]: 39: Hoare triple {1790#false} call reset_delta_events1(); {1831#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:42,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {1831#(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); {1789#true} is VALID [2022-02-20 19:56:42,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {1789#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1789#true} is VALID [2022-02-20 19:56:42,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,933 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1789#true} {1790#false} #799#return; {1790#false} is VALID [2022-02-20 19:56:42,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 19:56:42,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {1790#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; {1790#false} is VALID [2022-02-20 19:56:42,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 19:56:42,934 INFO L272 TraceCheckUtils]: 47: Hoare triple {1790#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {1789#true} is VALID [2022-02-20 19:56:42,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {1789#true} havoc ~__retres1~2; {1789#true} is VALID [2022-02-20 19:56:42,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {1789#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1789#true} is VALID [2022-02-20 19:56:42,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {1789#true} #res := ~__retres1~2; {1789#true} is VALID [2022-02-20 19:56:42,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-02-20 19:56:42,935 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1789#true} {1790#false} #801#return; {1790#false} is VALID [2022-02-20 19:56:42,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {1790#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; {1790#false} is VALID [2022-02-20 19:56:42,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {1790#false} assume 0 != eval1_~tmp___1~0#1; {1790#false} is VALID [2022-02-20 19:56:42,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {1790#false} assume !(0 == ~p_dw_st~0); {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {1790#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; {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {1790#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; {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {1790#false} assume 0 == ~c_dr_pc~0; {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {1790#false} assume !(1 == ~q_free~0); {1790#false} is VALID [2022-02-20 19:56:42,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {1790#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; {1790#false} is VALID [2022-02-20 19:56:42,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {1790#false} assume !(~p_last_write~0 == ~c_last_read~0); {1790#false} is VALID [2022-02-20 19:56:42,937 INFO L272 TraceCheckUtils]: 63: Hoare triple {1790#false} call error1(); {1790#false} is VALID [2022-02-20 19:56:42,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 19:56:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:42,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:42,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697684881] [2022-02-20 19:56:42,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697684881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:42,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:42,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:42,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649417604] [2022-02-20 19:56:42,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:42,940 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:56:42,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:42,940 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:56:42,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:42,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:42,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:42,972 INFO L87 Difference]: Start difference. First operand 230 states and 328 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:44,687 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-02-20 19:56:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:44,688 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:56:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:44,688 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:56:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 642 transitions. [2022-02-20 19:56:44,695 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:56:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 642 transitions. [2022-02-20 19:56:44,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 642 transitions. [2022-02-20 19:56:45,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 642 edges. 642 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:45,143 INFO L225 Difference]: With dead ends: 453 [2022-02-20 19:56:45,143 INFO L226 Difference]: Without dead ends: 365 [2022-02-20 19:56:45,144 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:56:45,145 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 452 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:45,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 1117 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-02-20 19:56:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2022-02-20 19:56:45,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:45,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:45,170 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:45,170 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:45,182 INFO L93 Difference]: Finished difference Result 365 states and 513 transitions. [2022-02-20 19:56:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 513 transitions. [2022-02-20 19:56:45,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:45,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:45,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 365 states. [2022-02-20 19:56:45,185 INFO L87 Difference]: Start difference. First operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 365 states. [2022-02-20 19:56:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:45,196 INFO L93 Difference]: Finished difference Result 365 states and 513 transitions. [2022-02-20 19:56:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 513 transitions. [2022-02-20 19:56:45,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:45,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:45,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:45,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:56:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2022-02-20 19:56:45,208 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2022-02-20 19:56:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:45,209 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2022-02-20 19:56:45,209 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:56:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2022-02-20 19:56:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:45,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:45,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:45,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:45,211 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2022-02-20 19:56:45,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:45,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721198262] [2022-02-20 19:56:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {3708#(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); {3669#true} is VALID [2022-02-20 19:56:45,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3669#true} {3669#true} #793#return; {3669#true} is VALID [2022-02-20 19:56:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {3709#(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); {3669#true} is VALID [2022-02-20 19:56:45,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume !(0 == ~q_write_ev~0); {3669#true} is VALID [2022-02-20 19:56:45,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3669#true} {3669#true} #795#return; {3669#true} is VALID [2022-02-20 19:56:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {3669#true} havoc ~__retres1~0; {3669#true} is VALID [2022-02-20 19:56:45,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume !(1 == ~p_dw_pc~0); {3669#true} is VALID [2022-02-20 19:56:45,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} ~__retres1~0 := 0; {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:45,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,321 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3669#true} #789#return; {3717#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {3669#true} havoc ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume 1 == ~c_dr_pc~0; {3669#true} is VALID [2022-02-20 19:56:45,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3669#true} is VALID [2022-02-20 19:56:45,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {3669#true} #res := ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,325 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3669#true} {3670#false} #791#return; {3670#false} is VALID [2022-02-20 19:56:45,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {3710#(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; {3669#true} is VALID [2022-02-20 19:56:45,326 INFO L272 TraceCheckUtils]: 1: Hoare triple {3669#true} call #t~ret8 := is_do_write_p_triggered(); {3669#true} is VALID [2022-02-20 19:56:45,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} havoc ~__retres1~0; {3669#true} is VALID [2022-02-20 19:56:45,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {3669#true} assume !(1 == ~p_dw_pc~0); {3669#true} is VALID [2022-02-20 19:56:45,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {3669#true} ~__retres1~0 := 0; {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:45,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,328 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3669#true} #789#return; {3717#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:45,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {3717#(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; {3718#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:45,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {3718#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3670#false} is VALID [2022-02-20 19:56:45,329 INFO L272 TraceCheckUtils]: 10: Hoare triple {3670#false} call #t~ret9 := is_do_read_c_triggered(); {3669#true} is VALID [2022-02-20 19:56:45,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {3669#true} havoc ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {3669#true} assume 1 == ~c_dr_pc~0; {3669#true} is VALID [2022-02-20 19:56:45,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {3669#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3669#true} is VALID [2022-02-20 19:56:45,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {3669#true} #res := ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,330 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3669#true} {3670#false} #791#return; {3670#false} is VALID [2022-02-20 19:56:45,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {3670#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3670#false} is VALID [2022-02-20 19:56:45,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {3670#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3670#false} is VALID [2022-02-20 19:56:45,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {3670#false} assume true; {3670#false} is VALID [2022-02-20 19:56:45,330 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3670#false} {3669#true} #797#return; {3670#false} is VALID [2022-02-20 19:56:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {3709#(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); {3669#true} is VALID [2022-02-20 19:56:45,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3669#true} is VALID [2022-02-20 19:56:45,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3669#true} {3670#false} #799#return; {3670#false} is VALID [2022-02-20 19:56:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:45,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {3669#true} havoc ~__retres1~2; {3669#true} is VALID [2022-02-20 19:56:45,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3669#true} is VALID [2022-02-20 19:56:45,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} #res := ~__retres1~2; {3669#true} is VALID [2022-02-20 19:56:45,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,338 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3669#true} {3670#false} #801#return; {3670#false} is VALID [2022-02-20 19:56:45,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {3669#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {3669#true} is VALID [2022-02-20 19:56:45,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {3669#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {3669#true} is VALID [2022-02-20 19:56:45,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {3669#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {3669#true} is VALID [2022-02-20 19:56:45,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {3669#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; {3669#true} is VALID [2022-02-20 19:56:45,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {3669#true} call update_channels1(); {3708#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:45,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {3708#(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); {3669#true} is VALID [2022-02-20 19:56:45,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,339 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3669#true} {3669#true} #793#return; {3669#true} is VALID [2022-02-20 19:56:45,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {3669#true} assume { :begin_inline_init_threads1 } true; {3669#true} is VALID [2022-02-20 19:56:45,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {3669#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3669#true} is VALID [2022-02-20 19:56:45,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {3669#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3669#true} is VALID [2022-02-20 19:56:45,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {3669#true} assume { :end_inline_init_threads1 } true; {3669#true} is VALID [2022-02-20 19:56:45,340 INFO L272 TraceCheckUtils]: 12: Hoare triple {3669#true} call fire_delta_events1(); {3709#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:45,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {3709#(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); {3669#true} is VALID [2022-02-20 19:56:45,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {3669#true} assume !(0 == ~q_write_ev~0); {3669#true} is VALID [2022-02-20 19:56:45,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3669#true} {3669#true} #795#return; {3669#true} is VALID [2022-02-20 19:56:45,342 INFO L272 TraceCheckUtils]: 17: Hoare triple {3669#true} call activate_threads1(); {3710#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:45,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {3710#(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; {3669#true} is VALID [2022-02-20 19:56:45,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {3669#true} call #t~ret8 := is_do_write_p_triggered(); {3669#true} is VALID [2022-02-20 19:56:45,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {3669#true} havoc ~__retres1~0; {3669#true} is VALID [2022-02-20 19:56:45,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {3669#true} assume !(1 == ~p_dw_pc~0); {3669#true} is VALID [2022-02-20 19:56:45,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {3669#true} ~__retres1~0 := 0; {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:45,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {3725#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:45,344 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3726#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3669#true} #789#return; {3717#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:45,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {3717#(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; {3718#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:45,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {3718#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3670#false} is VALID [2022-02-20 19:56:45,345 INFO L272 TraceCheckUtils]: 28: Hoare triple {3670#false} call #t~ret9 := is_do_read_c_triggered(); {3669#true} is VALID [2022-02-20 19:56:45,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#true} havoc ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {3669#true} assume 1 == ~c_dr_pc~0; {3669#true} is VALID [2022-02-20 19:56:45,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {3669#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3669#true} is VALID [2022-02-20 19:56:45,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {3669#true} #res := ~__retres1~1; {3669#true} is VALID [2022-02-20 19:56:45,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,346 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3669#true} {3670#false} #791#return; {3670#false} is VALID [2022-02-20 19:56:45,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {3670#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3670#false} is VALID [2022-02-20 19:56:45,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {3670#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3670#false} is VALID [2022-02-20 19:56:45,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {3670#false} assume true; {3670#false} is VALID [2022-02-20 19:56:45,346 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3670#false} {3669#true} #797#return; {3670#false} is VALID [2022-02-20 19:56:45,347 INFO L272 TraceCheckUtils]: 39: Hoare triple {3670#false} call reset_delta_events1(); {3709#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:45,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {3709#(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); {3669#true} is VALID [2022-02-20 19:56:45,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {3669#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3669#true} is VALID [2022-02-20 19:56:45,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,347 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3669#true} {3670#false} #799#return; {3670#false} is VALID [2022-02-20 19:56:45,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {3670#false} assume !false; {3670#false} is VALID [2022-02-20 19:56:45,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {3670#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; {3670#false} is VALID [2022-02-20 19:56:45,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {3670#false} assume !false; {3670#false} is VALID [2022-02-20 19:56:45,348 INFO L272 TraceCheckUtils]: 47: Hoare triple {3670#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3669#true} is VALID [2022-02-20 19:56:45,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {3669#true} havoc ~__retres1~2; {3669#true} is VALID [2022-02-20 19:56:45,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {3669#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3669#true} is VALID [2022-02-20 19:56:45,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {3669#true} #res := ~__retres1~2; {3669#true} is VALID [2022-02-20 19:56:45,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {3669#true} assume true; {3669#true} is VALID [2022-02-20 19:56:45,348 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3669#true} {3670#false} #801#return; {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {3670#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; {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {3670#false} assume 0 != eval1_~tmp___1~0#1; {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {3670#false} assume !(0 == ~p_dw_st~0); {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {3670#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; {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {3670#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; {3670#false} is VALID [2022-02-20 19:56:45,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {3670#false} assume 0 == ~c_dr_pc~0; {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {3670#false} assume !false; {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {3670#false} assume !(1 == ~q_free~0); {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {3670#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; {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {3670#false} assume !(~p_last_write~0 == ~c_last_read~0); {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L272 TraceCheckUtils]: 63: Hoare triple {3670#false} call error1(); {3670#false} is VALID [2022-02-20 19:56:45,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {3670#false} assume !false; {3670#false} is VALID [2022-02-20 19:56:45,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:56:45,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:45,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721198262] [2022-02-20 19:56:45,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721198262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:45,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:45,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:45,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020276729] [2022-02-20 19:56:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:45,352 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:56:45,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:45,353 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:56:45,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:45,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:45,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:45,387 INFO L87 Difference]: Start difference. First operand 326 states and 459 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:56:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:47,376 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2022-02-20 19:56:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:47,376 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:56:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:47,377 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:56:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 484 transitions. [2022-02-20 19:56:47,388 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:56:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 484 transitions. [2022-02-20 19:56:47,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 484 transitions. [2022-02-20 19:56:47,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:47,687 INFO L225 Difference]: With dead ends: 540 [2022-02-20 19:56:47,687 INFO L226 Difference]: Without dead ends: 363 [2022-02-20 19:56:47,687 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:56:47,688 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 252 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:47,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1450 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-02-20 19:56:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2022-02-20 19:56:47,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:47,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:47,719 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:47,720 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:47,732 INFO L93 Difference]: Finished difference Result 363 states and 509 transitions. [2022-02-20 19:56:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 509 transitions. [2022-02-20 19:56:47,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:47,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:47,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 363 states. [2022-02-20 19:56:47,738 INFO L87 Difference]: Start difference. First operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 363 states. [2022-02-20 19:56:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:47,747 INFO L93 Difference]: Finished difference Result 363 states and 509 transitions. [2022-02-20 19:56:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 509 transitions. [2022-02-20 19:56:47,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:47,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:47,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:47,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:56:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2022-02-20 19:56:47,757 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2022-02-20 19:56:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:47,757 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2022-02-20 19:56:47,757 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:56:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2022-02-20 19:56:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:47,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:47,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:47,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:47,759 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2022-02-20 19:56:47,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:47,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130448032] [2022-02-20 19:56:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {5701#(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); {5702#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:47,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#(not (= |old(~q_req_up~0)| 1))} assume true; {5702#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:47,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5702#(not (= |old(~q_req_up~0)| 1))} {5662#(= ~c_dr_pc~0 ~q_req_up~0)} #793#return; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {5703#(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); {5659#true} is VALID [2022-02-20 19:56:47,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} assume !(0 == ~q_write_ev~0); {5659#true} is VALID [2022-02-20 19:56:47,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5659#true} {5666#(not (= ~c_dr_pc~0 1))} #795#return; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {5659#true} havoc ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} assume !(1 == ~p_dw_pc~0); {5659#true} is VALID [2022-02-20 19:56:47,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} ~__retres1~0 := 0; {5659#true} is VALID [2022-02-20 19:56:47,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {5659#true} #res := ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,897 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5659#true} {5659#true} #789#return; {5659#true} is VALID [2022-02-20 19:56:47,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {5659#true} havoc ~__retres1~1; {5659#true} is VALID [2022-02-20 19:56:47,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} assume 1 == ~c_dr_pc~0; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,911 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} {5659#true} #791#return; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {5704#(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; {5659#true} is VALID [2022-02-20 19:56:47,911 INFO L272 TraceCheckUtils]: 1: Hoare triple {5659#true} call #t~ret8 := is_do_write_p_triggered(); {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} havoc ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {5659#true} assume !(1 == ~p_dw_pc~0); {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {5659#true} ~__retres1~0 := 0; {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {5659#true} #res := ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,912 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5659#true} {5659#true} #789#return; {5659#true} is VALID [2022-02-20 19:56:47,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {5659#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5659#true} is VALID [2022-02-20 19:56:47,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {5659#true} assume !(0 != ~tmp~1); {5659#true} is VALID [2022-02-20 19:56:47,913 INFO L272 TraceCheckUtils]: 10: Hoare triple {5659#true} call #t~ret9 := is_do_read_c_triggered(); {5659#true} is VALID [2022-02-20 19:56:47,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#true} havoc ~__retres1~1; {5659#true} is VALID [2022-02-20 19:56:47,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {5659#true} assume 1 == ~c_dr_pc~0; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,915 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} {5659#true} #791#return; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,916 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} {5666#(not (= ~c_dr_pc~0 1))} #797#return; {5660#false} is VALID [2022-02-20 19:56:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {5703#(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); {5659#true} is VALID [2022-02-20 19:56:47,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5659#true} is VALID [2022-02-20 19:56:47,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5659#true} {5660#false} #799#return; {5660#false} is VALID [2022-02-20 19:56:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {5659#true} havoc ~__retres1~2; {5659#true} is VALID [2022-02-20 19:56:47,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {5659#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5659#true} is VALID [2022-02-20 19:56:47,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#true} #res := ~__retres1~2; {5659#true} is VALID [2022-02-20 19:56:47,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,932 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5659#true} {5660#false} #801#return; {5660#false} is VALID [2022-02-20 19:56:47,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {5659#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {5661#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:47,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {5661#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {5661#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:56:47,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {5661#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {5662#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:56:47,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {5662#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {5662#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:56:47,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {5662#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {5701#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:47,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {5701#(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); {5702#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:47,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {5702#(not (= |old(~q_req_up~0)| 1))} assume true; {5702#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:56:47,935 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5702#(not (= |old(~q_req_up~0)| 1))} {5662#(= ~c_dr_pc~0 ~q_req_up~0)} #793#return; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,937 INFO L272 TraceCheckUtils]: 12: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {5703#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {5703#(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); {5659#true} is VALID [2022-02-20 19:56:47,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {5659#true} assume !(0 == ~q_write_ev~0); {5659#true} is VALID [2022-02-20 19:56:47,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5659#true} {5666#(not (= ~c_dr_pc~0 1))} #795#return; {5666#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:56:47,938 INFO L272 TraceCheckUtils]: 17: Hoare triple {5666#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {5704#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:47,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {5704#(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; {5659#true} is VALID [2022-02-20 19:56:47,938 INFO L272 TraceCheckUtils]: 19: Hoare triple {5659#true} call #t~ret8 := is_do_write_p_triggered(); {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {5659#true} havoc ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {5659#true} assume !(1 == ~p_dw_pc~0); {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {5659#true} ~__retres1~0 := 0; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {5659#true} #res := ~__retres1~0; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5659#true} {5659#true} #789#return; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {5659#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5659#true} is VALID [2022-02-20 19:56:47,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {5659#true} assume !(0 != ~tmp~1); {5659#true} is VALID [2022-02-20 19:56:47,940 INFO L272 TraceCheckUtils]: 28: Hoare triple {5659#true} call #t~ret9 := is_do_read_c_triggered(); {5659#true} is VALID [2022-02-20 19:56:47,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {5659#true} havoc ~__retres1~1; {5659#true} is VALID [2022-02-20 19:56:47,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {5659#true} assume 1 == ~c_dr_pc~0; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,941 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} {5659#true} #791#return; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:56:47,943 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5717#(= (+ (- 1) ~c_dr_pc~0) 0)} {5666#(not (= ~c_dr_pc~0 1))} #797#return; {5660#false} is VALID [2022-02-20 19:56:47,943 INFO L272 TraceCheckUtils]: 39: Hoare triple {5660#false} call reset_delta_events1(); {5703#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {5703#(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); {5659#true} is VALID [2022-02-20 19:56:47,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {5659#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5659#true} is VALID [2022-02-20 19:56:47,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,943 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5659#true} {5660#false} #799#return; {5660#false} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {5660#false} assume !false; {5660#false} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {5660#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; {5660#false} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {5660#false} assume !false; {5660#false} is VALID [2022-02-20 19:56:47,944 INFO L272 TraceCheckUtils]: 47: Hoare triple {5660#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5659#true} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {5659#true} havoc ~__retres1~2; {5659#true} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {5659#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5659#true} is VALID [2022-02-20 19:56:47,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {5659#true} #res := ~__retres1~2; {5659#true} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {5659#true} assume true; {5659#true} is VALID [2022-02-20 19:56:47,945 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5659#true} {5660#false} #801#return; {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {5660#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; {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {5660#false} assume 0 != eval1_~tmp___1~0#1; {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {5660#false} assume !(0 == ~p_dw_st~0); {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {5660#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; {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {5660#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; {5660#false} is VALID [2022-02-20 19:56:47,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {5660#false} assume 0 == ~c_dr_pc~0; {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {5660#false} assume !false; {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {5660#false} assume !(1 == ~q_free~0); {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {5660#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; {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {5660#false} assume !(~p_last_write~0 == ~c_last_read~0); {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L272 TraceCheckUtils]: 63: Hoare triple {5660#false} call error1(); {5660#false} is VALID [2022-02-20 19:56:47,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {5660#false} assume !false; {5660#false} is VALID [2022-02-20 19:56:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:47,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:47,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130448032] [2022-02-20 19:56:47,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130448032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:47,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:47,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:56:47,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136432641] [2022-02-20 19:56:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:56:47,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:47,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:47,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:47,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:56:48,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:56:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:56:48,000 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,084 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2022-02-20 19:56:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:56:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:56:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1002 transitions. [2022-02-20 19:56:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1002 transitions. [2022-02-20 19:56:52,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1002 transitions. [2022-02-20 19:56:52,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1002 edges. 1002 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:52,828 INFO L225 Difference]: With dead ends: 1231 [2022-02-20 19:56:52,828 INFO L226 Difference]: Without dead ends: 1037 [2022-02-20 19:56:52,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:56:52,831 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2104 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:52,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2120 Valid, 1486 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:56:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-02-20 19:56:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2022-02-20 19:56:52,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:52,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1037 states. Second operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:52,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1037 states. Second operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:52,882 INFO L87 Difference]: Start difference. First operand 1037 states. Second operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,922 INFO L93 Difference]: Finished difference Result 1037 states and 1351 transitions. [2022-02-20 19:56:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1351 transitions. [2022-02-20 19:56:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:52,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:52,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1037 states. [2022-02-20 19:56:52,939 INFO L87 Difference]: Start difference. First operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1037 states. [2022-02-20 19:56:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,977 INFO L93 Difference]: Finished difference Result 1037 states and 1351 transitions. [2022-02-20 19:56:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1351 transitions. [2022-02-20 19:56:52,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:52,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:52,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:52,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:56:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2022-02-20 19:56:53,020 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2022-02-20 19:56:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:53,021 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2022-02-20 19:56:53,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:56:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2022-02-20 19:56:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:53,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:53,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:53,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:56:53,023 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2022-02-20 19:56:53,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:53,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841280489] [2022-02-20 19:56:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {10796#(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); {10757#true} is VALID [2022-02-20 19:56:53,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10757#true} {10757#true} #793#return; {10757#true} is VALID [2022-02-20 19:56:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {10797#(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); {10757#true} is VALID [2022-02-20 19:56:53,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume !(0 == ~q_write_ev~0); {10757#true} is VALID [2022-02-20 19:56:53,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10757#true} {10757#true} #795#return; {10757#true} is VALID [2022-02-20 19:56:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {10757#true} havoc ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume !(1 == ~p_dw_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} ~__retres1~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {10757#true} #res := ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10757#true} {10757#true} #789#return; {10757#true} is VALID [2022-02-20 19:56:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {10757#true} havoc ~__retres1~1; {10757#true} is VALID [2022-02-20 19:56:53,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume !(1 == ~c_dr_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} ~__retres1~1 := 0; {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:53,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,135 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10757#true} #791#return; {10811#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {10798#(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; {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L272 TraceCheckUtils]: 1: Hoare triple {10757#true} call #t~ret8 := is_do_write_p_triggered(); {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} havoc ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {10757#true} assume !(1 == ~p_dw_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {10757#true} ~__retres1~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {10757#true} #res := ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10757#true} {10757#true} #789#return; {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {10757#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {10757#true} assume !(0 != ~tmp~1); {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L272 TraceCheckUtils]: 10: Hoare triple {10757#true} call #t~ret9 := is_do_read_c_triggered(); {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {10757#true} havoc ~__retres1~1; {10757#true} is VALID [2022-02-20 19:56:53,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {10757#true} assume !(1 == ~c_dr_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {10757#true} ~__retres1~1 := 0; {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,139 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10757#true} #791#return; {10811#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:53,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {10811#(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; {10812#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:53,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {10812#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10758#false} is VALID [2022-02-20 19:56:53,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {10758#false} assume true; {10758#false} is VALID [2022-02-20 19:56:53,140 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10758#false} {10757#true} #797#return; {10758#false} is VALID [2022-02-20 19:56:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {10797#(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); {10757#true} is VALID [2022-02-20 19:56:53,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10757#true} is VALID [2022-02-20 19:56:53,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10757#true} {10758#false} #799#return; {10758#false} is VALID [2022-02-20 19:56:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {10757#true} havoc ~__retres1~2; {10757#true} is VALID [2022-02-20 19:56:53,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10757#true} is VALID [2022-02-20 19:56:53,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} #res := ~__retres1~2; {10757#true} is VALID [2022-02-20 19:56:53,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,149 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10757#true} {10758#false} #801#return; {10758#false} is VALID [2022-02-20 19:56:53,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {10757#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {10757#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {10757#true} is VALID [2022-02-20 19:56:53,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {10757#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {10757#true} is VALID [2022-02-20 19:56:53,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {10757#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; {10757#true} is VALID [2022-02-20 19:56:53,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {10757#true} call update_channels1(); {10796#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:53,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {10796#(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); {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10757#true} {10757#true} #793#return; {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {10757#true} assume { :begin_inline_init_threads1 } true; {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {10757#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {10757#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {10757#true} assume { :end_inline_init_threads1 } true; {10757#true} is VALID [2022-02-20 19:56:53,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {10757#true} call fire_delta_events1(); {10797#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:53,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {10797#(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); {10757#true} is VALID [2022-02-20 19:56:53,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {10757#true} assume !(0 == ~q_write_ev~0); {10757#true} is VALID [2022-02-20 19:56:53,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,156 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10757#true} {10757#true} #795#return; {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {10757#true} call activate_threads1(); {10798#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:53,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {10798#(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; {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {10757#true} call #t~ret8 := is_do_write_p_triggered(); {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {10757#true} havoc ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {10757#true} assume !(1 == ~p_dw_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {10757#true} ~__retres1~0 := 0; {10757#true} is VALID [2022-02-20 19:56:53,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {10757#true} #res := ~__retres1~0; {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10757#true} {10757#true} #789#return; {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {10757#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#true} assume !(0 != ~tmp~1); {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L272 TraceCheckUtils]: 28: Hoare triple {10757#true} call #t~ret9 := is_do_read_c_triggered(); {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {10757#true} havoc ~__retres1~1; {10757#true} is VALID [2022-02-20 19:56:53,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {10757#true} assume !(1 == ~c_dr_pc~0); {10757#true} is VALID [2022-02-20 19:56:53,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {10757#true} ~__retres1~1 := 0; {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:53,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {10813#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:53,160 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10814#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10757#true} #791#return; {10811#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:53,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {10811#(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; {10812#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:53,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {10812#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10758#false} is VALID [2022-02-20 19:56:53,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {10758#false} assume true; {10758#false} is VALID [2022-02-20 19:56:53,161 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10758#false} {10757#true} #797#return; {10758#false} is VALID [2022-02-20 19:56:53,161 INFO L272 TraceCheckUtils]: 39: Hoare triple {10758#false} call reset_delta_events1(); {10797#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:53,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {10797#(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); {10757#true} is VALID [2022-02-20 19:56:53,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {10757#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10757#true} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,162 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10757#true} {10758#false} #799#return; {10758#false} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {10758#false} assume !false; {10758#false} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {10758#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; {10758#false} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {10758#false} assume !false; {10758#false} is VALID [2022-02-20 19:56:53,162 INFO L272 TraceCheckUtils]: 47: Hoare triple {10758#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10757#true} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {10757#true} havoc ~__retres1~2; {10757#true} is VALID [2022-02-20 19:56:53,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {10757#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10757#true} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {10757#true} #res := ~__retres1~2; {10757#true} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {10757#true} assume true; {10757#true} is VALID [2022-02-20 19:56:53,163 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10757#true} {10758#false} #801#return; {10758#false} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {10758#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; {10758#false} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {10758#false} assume 0 != eval1_~tmp___1~0#1; {10758#false} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {10758#false} assume !(0 == ~p_dw_st~0); {10758#false} is VALID [2022-02-20 19:56:53,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {10758#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; {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {10758#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; {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {10758#false} assume 0 == ~c_dr_pc~0; {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {10758#false} assume !false; {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {10758#false} assume !(1 == ~q_free~0); {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {10758#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; {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {10758#false} assume !(~p_last_write~0 == ~c_last_read~0); {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L272 TraceCheckUtils]: 63: Hoare triple {10758#false} call error1(); {10758#false} is VALID [2022-02-20 19:56:53,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {10758#false} assume !false; {10758#false} is VALID [2022-02-20 19:56:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:53,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:53,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841280489] [2022-02-20 19:56:53,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841280489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:53,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:53,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:53,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193083794] [2022-02-20 19:56:53,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:53,166 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:56:53,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:53,167 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:56:53,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:53,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:53,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:53,197 INFO L87 Difference]: Start difference. First operand 912 states and 1204 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:56:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,199 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2022-02-20 19:56:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:56:55,199 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:56:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:55,201 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:56:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 484 transitions. [2022-02-20 19:56:55,205 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:56:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 484 transitions. [2022-02-20 19:56:55,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 484 transitions. [2022-02-20 19:56:55,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,540 INFO L225 Difference]: With dead ends: 1793 [2022-02-20 19:56:55,540 INFO L226 Difference]: Without dead ends: 1024 [2022-02-20 19:56:55,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:56:55,543 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 252 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:55,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 1446 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-02-20 19:56:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2022-02-20 19:56:55,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:55,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1024 states. Second operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:55,602 INFO L74 IsIncluded]: Start isIncluded. First operand 1024 states. Second operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:55,604 INFO L87 Difference]: Start difference. First operand 1024 states. Second operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,641 INFO L93 Difference]: Finished difference Result 1024 states and 1331 transitions. [2022-02-20 19:56:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1331 transitions. [2022-02-20 19:56:55,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1024 states. [2022-02-20 19:56:55,649 INFO L87 Difference]: Start difference. First operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1024 states. [2022-02-20 19:56:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,686 INFO L93 Difference]: Finished difference Result 1024 states and 1331 transitions. [2022-02-20 19:56:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1331 transitions. [2022-02-20 19:56:55,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:55,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:56:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2022-02-20 19:56:55,738 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2022-02-20 19:56:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:55,738 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2022-02-20 19:56:55,738 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:56:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2022-02-20 19:56:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:55,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:55,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:55,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:56:55,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2022-02-20 19:56:55,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:55,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174958244] [2022-02-20 19:56:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {16597#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #793#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {16598#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {16598#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #795#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#true} havoc ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {16557#true} assume !(1 == ~p_dw_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {16557#true} ~__retres1~0 := 0; {16557#true} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {16557#true} #res := ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,825 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16557#true} {16557#true} #789#return; {16557#true} is VALID [2022-02-20 19:56:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#true} havoc ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {16557#true} assume !(1 == ~c_dr_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {16557#true} ~__retres1~1 := 0; {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {16557#true} #res := ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16557#true} {16557#true} #791#return; {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {16599#(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; {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L272 TraceCheckUtils]: 1: Hoare triple {16557#true} call #t~ret8 := is_do_write_p_triggered(); {16557#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {16557#true} havoc ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {16557#true} assume !(1 == ~p_dw_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {16557#true} ~__retres1~0 := 0; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {16557#true} #res := ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16557#true} {16557#true} #789#return; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {16557#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {16557#true} assume !(0 != ~tmp~1); {16557#true} is VALID [2022-02-20 19:56:55,842 INFO L272 TraceCheckUtils]: 10: Hoare triple {16557#true} call #t~ret9 := is_do_read_c_triggered(); {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {16557#true} havoc ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {16557#true} assume !(1 == ~c_dr_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {16557#true} ~__retres1~1 := 0; {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {16557#true} #res := ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16557#true} {16557#true} #791#return; {16557#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {16557#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16557#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {16557#true} assume !(0 != ~tmp___0~1); {16557#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,844 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16557#true} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #797#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {16598#(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); {16612#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:56:55,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {16612#(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; {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:55,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:55,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #799#return; {16558#false} is VALID [2022-02-20 19:56:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#true} havoc ~__retres1~2; {16557#true} is VALID [2022-02-20 19:56:55,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {16557#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16557#true} is VALID [2022-02-20 19:56:55,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {16557#true} #res := ~__retres1~2; {16557#true} is VALID [2022-02-20 19:56:55,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,873 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16557#true} {16558#false} #801#return; {16558#false} is VALID [2022-02-20 19:56:55,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {16557#true} is VALID [2022-02-20 19:56:55,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {16557#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {16557#true} is VALID [2022-02-20 19:56:55,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {16557#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {16559#(= ~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; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {16597#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:55,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {16597#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,876 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #793#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {16598#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {16598#(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); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,886 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #795#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,887 INFO L272 TraceCheckUtils]: 17: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {16599#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:55,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {16599#(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; {16557#true} is VALID [2022-02-20 19:56:55,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {16557#true} call #t~ret8 := is_do_write_p_triggered(); {16557#true} is VALID [2022-02-20 19:56:55,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {16557#true} havoc ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {16557#true} assume !(1 == ~p_dw_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {16557#true} ~__retres1~0 := 0; {16557#true} is VALID [2022-02-20 19:56:55,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {16557#true} #res := ~__retres1~0; {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16557#true} {16557#true} #789#return; {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {16557#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {16557#true} assume !(0 != ~tmp~1); {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L272 TraceCheckUtils]: 28: Hoare triple {16557#true} call #t~ret9 := is_do_read_c_triggered(); {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {16557#true} havoc ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {16557#true} assume !(1 == ~c_dr_pc~0); {16557#true} is VALID [2022-02-20 19:56:55,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {16557#true} ~__retres1~1 := 0; {16557#true} is VALID [2022-02-20 19:56:55,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {16557#true} #res := ~__retres1~1; {16557#true} is VALID [2022-02-20 19:56:55,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,889 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16557#true} {16557#true} #791#return; {16557#true} is VALID [2022-02-20 19:56:55,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {16557#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16557#true} is VALID [2022-02-20 19:56:55,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {16557#true} assume !(0 != ~tmp___0~1); {16557#true} is VALID [2022-02-20 19:56:55,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,892 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16557#true} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #797#return; {16559#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:55,892 INFO L272 TraceCheckUtils]: 39: Hoare triple {16559#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {16598#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {16598#(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); {16612#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:56:55,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {16612#(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; {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:55,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:55,894 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16613#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16559#(= ~q_write_ev~0 ~q_read_ev~0)} #799#return; {16558#false} is VALID [2022-02-20 19:56:55,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {16558#false} assume !false; {16558#false} is VALID [2022-02-20 19:56:55,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {16558#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; {16558#false} is VALID [2022-02-20 19:56:55,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {16558#false} assume !false; {16558#false} is VALID [2022-02-20 19:56:55,894 INFO L272 TraceCheckUtils]: 47: Hoare triple {16558#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16557#true} is VALID [2022-02-20 19:56:55,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {16557#true} havoc ~__retres1~2; {16557#true} is VALID [2022-02-20 19:56:55,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {16557#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16557#true} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {16557#true} #res := ~__retres1~2; {16557#true} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {16557#true} assume true; {16557#true} is VALID [2022-02-20 19:56:55,895 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16557#true} {16558#false} #801#return; {16558#false} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {16558#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; {16558#false} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {16558#false} assume 0 != eval1_~tmp___1~0#1; {16558#false} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {16558#false} assume !(0 == ~p_dw_st~0); {16558#false} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {16558#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; {16558#false} is VALID [2022-02-20 19:56:55,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {16558#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; {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {16558#false} assume 0 == ~c_dr_pc~0; {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {16558#false} assume !false; {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {16558#false} assume !(1 == ~q_free~0); {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {16558#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; {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {16558#false} assume !(~p_last_write~0 == ~c_last_read~0); {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L272 TraceCheckUtils]: 63: Hoare triple {16558#false} call error1(); {16558#false} is VALID [2022-02-20 19:56:55,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {16558#false} assume !false; {16558#false} is VALID [2022-02-20 19:56:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:55,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:55,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174958244] [2022-02-20 19:56:55,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174958244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:55,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:55,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:55,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20622399] [2022-02-20 19:56:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:55,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:55,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:55,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:55,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:55,935 INFO L87 Difference]: Start difference. First operand 932 states and 1219 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:56:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,330 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2022-02-20 19:56:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:56:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 650 transitions. [2022-02-20 19:56:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 650 transitions. [2022-02-20 19:56:58,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 650 transitions. [2022-02-20 19:56:58,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 650 edges. 650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:58,895 INFO L225 Difference]: With dead ends: 2500 [2022-02-20 19:56:58,895 INFO L226 Difference]: Without dead ends: 1712 [2022-02-20 19:56:58,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:56:58,897 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 798 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:58,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 994 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-02-20 19:56:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2022-02-20 19:56:58,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:58,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1712 states. Second operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:56:58,985 INFO L74 IsIncluded]: Start isIncluded. First operand 1712 states. Second operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:56:58,988 INFO L87 Difference]: Start difference. First operand 1712 states. Second operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:56:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:59,081 INFO L93 Difference]: Finished difference Result 1712 states and 2143 transitions. [2022-02-20 19:56:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2143 transitions. [2022-02-20 19:56:59,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:59,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:59,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1712 states. [2022-02-20 19:56:59,089 INFO L87 Difference]: Start difference. First operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1712 states. [2022-02-20 19:56:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:59,180 INFO L93 Difference]: Finished difference Result 1712 states and 2143 transitions. [2022-02-20 19:56:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2143 transitions. [2022-02-20 19:56:59,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:59,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:59,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:59,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:56:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2022-02-20 19:56:59,266 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2022-02-20 19:56:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:59,266 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2022-02-20 19:56:59,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2022-02-20 19:56:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:59,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:59,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:59,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:56:59,267 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2022-02-20 19:56:59,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:59,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442864406] [2022-02-20 19:56:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:59,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {25308#(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); {25268#true} is VALID [2022-02-20 19:56:59,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25268#true} {25268#true} #793#return; {25268#true} is VALID [2022-02-20 19:56:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {25309#(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); {25268#true} is VALID [2022-02-20 19:56:59,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume !(0 == ~q_write_ev~0); {25268#true} is VALID [2022-02-20 19:56:59,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25268#true} {25273#(= ~p_dw_st~0 0)} #795#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {25268#true} havoc ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume !(1 == ~p_dw_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} ~__retres1~0 := 0; {25268#true} is VALID [2022-02-20 19:56:59,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {25268#true} #res := ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,326 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #789#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {25268#true} havoc ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume !(1 == ~c_dr_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} ~__retres1~1 := 0; {25268#true} is VALID [2022-02-20 19:56:59,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {25268#true} #res := ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,330 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #791#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {25310#(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; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,331 INFO L272 TraceCheckUtils]: 1: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} havoc ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {25268#true} assume !(1 == ~p_dw_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {25268#true} ~__retres1~0 := 0; {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {25268#true} #res := ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #789#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,332 INFO L272 TraceCheckUtils]: 10: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {25268#true} is VALID [2022-02-20 19:56:59,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {25268#true} havoc ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {25268#true} assume !(1 == ~c_dr_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {25268#true} ~__retres1~1 := 0; {25268#true} is VALID [2022-02-20 19:56:59,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {25268#true} #res := ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,333 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #791#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,334 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {25273#(= ~p_dw_st~0 0)} #797#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {25309#(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); {25268#true} is VALID [2022-02-20 19:56:59,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume !(1 == ~q_write_ev~0); {25268#true} is VALID [2022-02-20 19:56:59,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25268#true} {25273#(= ~p_dw_st~0 0)} #799#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:59,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {25268#true} havoc ~__retres1~2; {25268#true} is VALID [2022-02-20 19:56:59,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {25273#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {25273#(= ~p_dw_st~0 0)} assume true; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,344 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25273#(= ~p_dw_st~0 0)} {25273#(= ~p_dw_st~0 0)} #801#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {25268#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {25268#true} is VALID [2022-02-20 19:56:59,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {25268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {25268#true} is VALID [2022-02-20 19:56:59,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {25268#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {25268#true} is VALID [2022-02-20 19:56:59,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {25268#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; {25268#true} is VALID [2022-02-20 19:56:59,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {25268#true} call update_channels1(); {25308#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:59,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {25308#(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); {25268#true} is VALID [2022-02-20 19:56:59,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,346 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25268#true} {25268#true} #793#return; {25268#true} is VALID [2022-02-20 19:56:59,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {25268#true} assume { :begin_inline_init_threads1 } true; {25268#true} is VALID [2022-02-20 19:56:59,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {25268#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {25273#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {25273#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,347 INFO L272 TraceCheckUtils]: 12: Hoare triple {25273#(= ~p_dw_st~0 0)} call fire_delta_events1(); {25309#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:59,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {25309#(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); {25268#true} is VALID [2022-02-20 19:56:59,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {25268#true} assume !(0 == ~q_write_ev~0); {25268#true} is VALID [2022-02-20 19:56:59,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,348 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25268#true} {25273#(= ~p_dw_st~0 0)} #795#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,348 INFO L272 TraceCheckUtils]: 17: Hoare triple {25273#(= ~p_dw_st~0 0)} call activate_threads1(); {25310#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:59,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {25310#(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; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,348 INFO L272 TraceCheckUtils]: 19: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {25268#true} havoc ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {25268#true} assume !(1 == ~p_dw_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {25268#true} ~__retres1~0 := 0; {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {25268#true} #res := ~__retres1~0; {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,349 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #789#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,350 INFO L272 TraceCheckUtils]: 28: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {25268#true} is VALID [2022-02-20 19:56:59,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {25268#true} havoc ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {25268#true} assume !(1 == ~c_dr_pc~0); {25268#true} is VALID [2022-02-20 19:56:59,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {25268#true} ~__retres1~1 := 0; {25268#true} is VALID [2022-02-20 19:56:59,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {25268#true} #res := ~__retres1~1; {25268#true} is VALID [2022-02-20 19:56:59,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,351 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25268#true} {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #791#return; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:59,352 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25311#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {25273#(= ~p_dw_st~0 0)} #797#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,353 INFO L272 TraceCheckUtils]: 39: Hoare triple {25273#(= ~p_dw_st~0 0)} call reset_delta_events1(); {25309#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:59,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {25309#(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); {25268#true} is VALID [2022-02-20 19:56:59,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {25268#true} assume !(1 == ~q_write_ev~0); {25268#true} is VALID [2022-02-20 19:56:59,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {25268#true} assume true; {25268#true} is VALID [2022-02-20 19:56:59,353 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {25268#true} {25273#(= ~p_dw_st~0 0)} #799#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {25273#(= ~p_dw_st~0 0)} assume !false; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {25273#(= ~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; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {25273#(= ~p_dw_st~0 0)} assume !false; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,354 INFO L272 TraceCheckUtils]: 47: Hoare triple {25273#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {25268#true} is VALID [2022-02-20 19:56:59,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {25268#true} havoc ~__retres1~2; {25268#true} is VALID [2022-02-20 19:56:59,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {25268#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {25273#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {25273#(= ~p_dw_st~0 0)} assume true; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,355 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25273#(= ~p_dw_st~0 0)} {25273#(= ~p_dw_st~0 0)} #801#return; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {25273#(= ~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; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {25273#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {25273#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:59,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {25273#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {25269#false} is VALID [2022-02-20 19:56:59,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {25269#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; {25269#false} is VALID [2022-02-20 19:56:59,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {25269#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; {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {25269#false} assume 0 == ~c_dr_pc~0; {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {25269#false} assume !false; {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {25269#false} assume !(1 == ~q_free~0); {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {25269#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; {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {25269#false} assume !(~p_last_write~0 == ~c_last_read~0); {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L272 TraceCheckUtils]: 63: Hoare triple {25269#false} call error1(); {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {25269#false} assume !false; {25269#false} is VALID [2022-02-20 19:56:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:59,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:59,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442864406] [2022-02-20 19:56:59,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442864406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:59,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:59,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:59,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749278806] [2022-02-20 19:56:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:59,359 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:56:59,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:59,359 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:56:59,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:59,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:59,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:59,391 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,281 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2022-02-20 19:57:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 594 transitions. [2022-02-20 19:57:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 594 transitions. [2022-02-20 19:57:01,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 594 transitions. [2022-02-20 19:57:01,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:01,961 INFO L225 Difference]: With dead ends: 3851 [2022-02-20 19:57:01,961 INFO L226 Difference]: Without dead ends: 2617 [2022-02-20 19:57:01,963 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:57:01,964 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 614 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:01,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 926 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2022-02-20 19:57:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2022-02-20 19:57:02,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:02,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2617 states. Second operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:02,122 INFO L74 IsIncluded]: Start isIncluded. First operand 2617 states. Second operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:02,135 INFO L87 Difference]: Start difference. First operand 2617 states. Second operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,335 INFO L93 Difference]: Finished difference Result 2617 states and 3292 transitions. [2022-02-20 19:57:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3292 transitions. [2022-02-20 19:57:02,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) Second operand 2617 states. [2022-02-20 19:57:02,347 INFO L87 Difference]: Start difference. First operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) Second operand 2617 states. [2022-02-20 19:57:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,544 INFO L93 Difference]: Finished difference Result 2617 states and 3292 transitions. [2022-02-20 19:57:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3292 transitions. [2022-02-20 19:57:02,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:02,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-02-20 19:57:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2022-02-20 19:57:02,817 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2022-02-20 19:57:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:02,817 INFO L470 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2022-02-20 19:57:02,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2022-02-20 19:57:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:02,818 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:02,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:02,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:02,818 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2022-02-20 19:57:02,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:02,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735528021] [2022-02-20 19:57:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {39189#(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); {39149#true} is VALID [2022-02-20 19:57:02,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #793#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {39190#(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); {39149#true} is VALID [2022-02-20 19:57:02,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume !(0 == ~q_write_ev~0); {39149#true} is VALID [2022-02-20 19:57:02,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #795#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {39149#true} havoc ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume !(1 == ~p_dw_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} ~__retres1~0 := 0; {39149#true} is VALID [2022-02-20 19:57:02,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {39149#true} #res := ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,899 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {39149#true} {39149#true} #789#return; {39149#true} is VALID [2022-02-20 19:57:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {39149#true} havoc ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume !(1 == ~c_dr_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} ~__retres1~1 := 0; {39149#true} is VALID [2022-02-20 19:57:02,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {39149#true} #res := ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,901 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {39149#true} {39149#true} #791#return; {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {39191#(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; {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L272 TraceCheckUtils]: 1: Hoare triple {39149#true} call #t~ret8 := is_do_write_p_triggered(); {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} havoc ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {39149#true} assume !(1 == ~p_dw_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {39149#true} ~__retres1~0 := 0; {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {39149#true} #res := ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {39149#true} {39149#true} #789#return; {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {39149#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {39149#true} assume !(0 != ~tmp~1); {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L272 TraceCheckUtils]: 10: Hoare triple {39149#true} call #t~ret9 := is_do_read_c_triggered(); {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {39149#true} havoc ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {39149#true} assume !(1 == ~c_dr_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {39149#true} ~__retres1~1 := 0; {39149#true} is VALID [2022-02-20 19:57:02,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {39149#true} #res := ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,904 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {39149#true} {39149#true} #791#return; {39149#true} is VALID [2022-02-20 19:57:02,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {39149#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {39149#true} is VALID [2022-02-20 19:57:02,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {39149#true} assume !(0 != ~tmp___0~1); {39149#true} is VALID [2022-02-20 19:57:02,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,905 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #797#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {39190#(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); {39149#true} is VALID [2022-02-20 19:57:02,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume !(1 == ~q_write_ev~0); {39149#true} is VALID [2022-02-20 19:57:02,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #799#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {39149#true} havoc ~__retres1~2; {39149#true} is VALID [2022-02-20 19:57:02,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {39149#true} is VALID [2022-02-20 19:57:02,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} #res := ~__retres1~2; {39149#true} is VALID [2022-02-20 19:57:02,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,915 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #801#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {39149#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {39149#true} is VALID [2022-02-20 19:57:02,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {39149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {39149#true} is VALID [2022-02-20 19:57:02,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {39149#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {39151#(= ~q_free~0 1)} call update_channels1(); {39189#(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:02,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {39189#(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); {39149#true} is VALID [2022-02-20 19:57:02,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,917 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #793#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {39151#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {39151#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {39151#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {39151#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,919 INFO L272 TraceCheckUtils]: 12: Hoare triple {39151#(= ~q_free~0 1)} call fire_delta_events1(); {39190#(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:02,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {39190#(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); {39149#true} is VALID [2022-02-20 19:57:02,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {39149#true} assume !(0 == ~q_write_ev~0); {39149#true} is VALID [2022-02-20 19:57:02,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,919 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #795#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,920 INFO L272 TraceCheckUtils]: 17: Hoare triple {39151#(= ~q_free~0 1)} call activate_threads1(); {39191#(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:02,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {39191#(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; {39149#true} is VALID [2022-02-20 19:57:02,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {39149#true} call #t~ret8 := is_do_write_p_triggered(); {39149#true} is VALID [2022-02-20 19:57:02,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {39149#true} havoc ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {39149#true} assume !(1 == ~p_dw_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {39149#true} ~__retres1~0 := 0; {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {39149#true} #res := ~__retres1~0; {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {39149#true} {39149#true} #789#return; {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {39149#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {39149#true} assume !(0 != ~tmp~1); {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L272 TraceCheckUtils]: 28: Hoare triple {39149#true} call #t~ret9 := is_do_read_c_triggered(); {39149#true} is VALID [2022-02-20 19:57:02,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {39149#true} havoc ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {39149#true} assume !(1 == ~c_dr_pc~0); {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {39149#true} ~__retres1~1 := 0; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {39149#true} #res := ~__retres1~1; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {39149#true} {39149#true} #791#return; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {39149#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {39149#true} is VALID [2022-02-20 19:57:02,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {39149#true} assume !(0 != ~tmp___0~1); {39149#true} is VALID [2022-02-20 19:57:02,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,923 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #797#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,923 INFO L272 TraceCheckUtils]: 39: Hoare triple {39151#(= ~q_free~0 1)} call reset_delta_events1(); {39190#(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:02,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {39190#(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); {39149#true} is VALID [2022-02-20 19:57:02,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {39149#true} assume !(1 == ~q_write_ev~0); {39149#true} is VALID [2022-02-20 19:57:02,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,924 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #799#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {39151#(= ~q_free~0 1)} assume !false; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {39151#(= ~q_free~0 1)} assume !false; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,925 INFO L272 TraceCheckUtils]: 47: Hoare triple {39151#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {39149#true} is VALID [2022-02-20 19:57:02,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {39149#true} havoc ~__retres1~2; {39149#true} is VALID [2022-02-20 19:57:02,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {39149#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {39149#true} is VALID [2022-02-20 19:57:02,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {39149#true} #res := ~__retres1~2; {39149#true} is VALID [2022-02-20 19:57:02,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {39149#true} assume true; {39149#true} is VALID [2022-02-20 19:57:02,926 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {39149#true} {39151#(= ~q_free~0 1)} #801#return; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {39151#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {39151#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {39151#(= ~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; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {39151#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {39151#(= ~q_free~0 1)} assume !false; {39151#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:02,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {39151#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {39150#false} is VALID [2022-02-20 19:57:02,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {39150#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; {39150#false} is VALID [2022-02-20 19:57:02,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {39150#false} assume !(~p_last_write~0 == ~c_last_read~0); {39150#false} is VALID [2022-02-20 19:57:02,929 INFO L272 TraceCheckUtils]: 64: Hoare triple {39150#false} call error1(); {39150#false} is VALID [2022-02-20 19:57:02,929 INFO L290 TraceCheckUtils]: 65: Hoare triple {39150#false} assume !false; {39150#false} is VALID [2022-02-20 19:57:02,930 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:02,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:02,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735528021] [2022-02-20 19:57:02,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735528021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:02,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:02,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:02,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862659705] [2022-02-20 19:57:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:02,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:02,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:02,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:02,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:02,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:02,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:02,971 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:05,620 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2022-02-20 19:57:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 593 transitions. [2022-02-20 19:57:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 593 transitions. [2022-02-20 19:57:05,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 593 transitions. [2022-02-20 19:57:05,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:06,509 INFO L225 Difference]: With dead ends: 5831 [2022-02-20 19:57:06,509 INFO L226 Difference]: Without dead ends: 3468 [2022-02-20 19:57:06,513 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:57:06,513 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:06,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 904 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-02-20 19:57:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2022-02-20 19:57:06,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:06,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3468 states. Second operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:06,696 INFO L74 IsIncluded]: Start isIncluded. First operand 3468 states. Second operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:06,700 INFO L87 Difference]: Start difference. First operand 3468 states. Second operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,116 INFO L93 Difference]: Finished difference Result 3468 states and 4318 transitions. [2022-02-20 19:57:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 4318 transitions. [2022-02-20 19:57:07,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3468 states. [2022-02-20 19:57:07,143 INFO L87 Difference]: Start difference. First operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3468 states. [2022-02-20 19:57:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,516 INFO L93 Difference]: Finished difference Result 3468 states and 4318 transitions. [2022-02-20 19:57:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 4318 transitions. [2022-02-20 19:57:07,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:07,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2022-02-20 19:57:07,990 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2022-02-20 19:57:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:07,991 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2022-02-20 19:57:07,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2022-02-20 19:57:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:07,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:07,994 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] [2022-02-20 19:57:07,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:07,994 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2022-02-20 19:57:07,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:07,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558914139] [2022-02-20 19:57:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,024 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {58316#true} {58318#(= ~m_i~0 1)} #817#return; {58318#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {58316#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {58316#true} assume !(0 == ~T2_E~0); {58316#true} is VALID [2022-02-20 19:57:08,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {58316#true} assume 0 == ~E_M~0;~E_M~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {58316#true} assume 0 == ~E_1~0;~E_1~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {58316#true} assume 0 == ~E_2~0;~E_2~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,035 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58316#true} {58317#false} #819#return; {58317#false} is VALID [2022-02-20 19:57:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {58363#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {58316#true} is VALID [2022-02-20 19:57:08,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {58316#true} assume !(1 == ~m_pc~0); {58316#true} is VALID [2022-02-20 19:57:08,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {58316#true} is_master_triggered_~__retres1~4#1 := 0; {58316#true} is VALID [2022-02-20 19:57:08,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {58316#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {58316#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {58316#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {58316#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {58316#true} assume 1 == ~t1_pc~0; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {58316#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {58316#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {58316#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {58316#true} is VALID [2022-02-20 19:57:08,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {58316#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {58316#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {58316#true} assume !(1 == ~t2_pc~0); {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {58316#true} is_transmit2_triggered_~__retres1~6#1 := 0; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {58316#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {58316#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {58316#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,049 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {58316#true} {58317#false} #821#return; {58317#false} is VALID [2022-02-20 19:57:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {58316#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {58316#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {58316#true} assume !(1 == ~E_M~0); {58316#true} is VALID [2022-02-20 19:57:08,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {58316#true} assume 1 == ~E_1~0;~E_1~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {58316#true} assume 1 == ~E_2~0;~E_2~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58316#true} {58317#false} #823#return; {58317#false} is VALID [2022-02-20 19:57:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {58316#true} havoc ~__retres1~7; {58316#true} is VALID [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {58316#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {58316#true} is VALID [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {58316#true} #res := ~__retres1~7; {58316#true} is VALID [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,058 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58316#true} {58317#false} #825#return; {58317#false} is VALID [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {58316#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {58316#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {58316#true} is VALID [2022-02-20 19:57:08,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {58316#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {58318#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:08,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {58318#(= ~m_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {58318#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:08,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {58318#(= ~m_i~0 1)} call update_channels2(); {58316#true} is VALID [2022-02-20 19:57:08,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,060 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58316#true} {58318#(= ~m_i~0 1)} #817#return; {58318#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:08,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {58318#(= ~m_i~0 1)} assume { :begin_inline_init_threads2 } true; {58318#(= ~m_i~0 1)} is VALID [2022-02-20 19:57:08,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {58318#(= ~m_i~0 1)} assume !(1 == ~m_i~0);~m_st~0 := 2; {58317#false} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {58317#false} assume 1 == ~t1_i~0;~t1_st~0 := 0; {58317#false} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {58317#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {58317#false} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {58317#false} assume { :end_inline_init_threads2 } true; {58317#false} is VALID [2022-02-20 19:57:08,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {58317#false} call fire_delta_events2(); {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {58316#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {58316#true} assume !(0 == ~T2_E~0); {58316#true} is VALID [2022-02-20 19:57:08,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {58316#true} assume 0 == ~E_M~0;~E_M~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {58316#true} assume 0 == ~E_1~0;~E_1~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {58316#true} assume 0 == ~E_2~0;~E_2~0 := 1; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {58316#true} {58317#false} #819#return; {58317#false} is VALID [2022-02-20 19:57:08,062 INFO L272 TraceCheckUtils]: 21: Hoare triple {58317#false} call activate_threads2(); {58363#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {58363#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {58316#true} assume !(1 == ~m_pc~0); {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {58316#true} is_master_triggered_~__retres1~4#1 := 0; {58316#true} is VALID [2022-02-20 19:57:08,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {58316#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {58316#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {58316#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {58316#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {58316#true} assume 1 == ~t1_pc~0; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {58316#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {58316#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {58316#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {58316#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {58316#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {58316#true} assume !(1 == ~t2_pc~0); {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {58316#true} is_transmit2_triggered_~__retres1~6#1 := 0; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {58316#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {58316#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {58316#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,064 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {58316#true} {58317#false} #821#return; {58317#false} is VALID [2022-02-20 19:57:08,064 INFO L272 TraceCheckUtils]: 42: Hoare triple {58317#false} call reset_delta_events2(); {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {58362#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {58316#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {58316#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {58316#true} assume !(1 == ~E_M~0); {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {58316#true} assume 1 == ~E_1~0;~E_1~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {58316#true} assume 1 == ~E_2~0;~E_2~0 := 2; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,065 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {58316#true} {58317#false} #823#return; {58317#false} is VALID [2022-02-20 19:57:08,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {58317#false} assume !false; {58317#false} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {58317#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {58317#false} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {58317#false} assume !false; {58317#false} is VALID [2022-02-20 19:57:08,066 INFO L272 TraceCheckUtils]: 54: Hoare triple {58317#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {58316#true} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {58316#true} havoc ~__retres1~7; {58316#true} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {58316#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {58316#true} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {58316#true} #res := ~__retres1~7; {58316#true} is VALID [2022-02-20 19:57:08,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {58316#true} assume true; {58316#true} is VALID [2022-02-20 19:57:08,066 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {58316#true} {58317#false} #825#return; {58317#false} is VALID [2022-02-20 19:57:08,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {58317#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {58317#false} is VALID [2022-02-20 19:57:08,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {58317#false} assume 0 != eval2_~tmp~5#1; {58317#false} is VALID [2022-02-20 19:57:08,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {58317#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {58317#false} is VALID [2022-02-20 19:57:08,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {58317#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {58317#false} is VALID [2022-02-20 19:57:08,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {58317#false} assume !(0 == ~m_pc~0); {58317#false} is VALID [2022-02-20 19:57:08,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {58317#false} assume 1 == ~m_pc~0; {58317#false} is VALID [2022-02-20 19:57:08,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {58317#false} assume ~token~0 != 2 + ~local~0; {58317#false} is VALID [2022-02-20 19:57:08,074 INFO L272 TraceCheckUtils]: 67: Hoare triple {58317#false} call error2(); {58317#false} is VALID [2022-02-20 19:57:08,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {58317#false} assume !false; {58317#false} is VALID [2022-02-20 19:57:08,074 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:08,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:08,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558914139] [2022-02-20 19:57:08,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558914139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:08,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:08,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:57:08,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161363141] [2022-02-20 19:57:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:08,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:08,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:08,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:08,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:57:08,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:57:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:57:08,114 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,683 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2022-02-20 19:57:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:57:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 572 transitions. [2022-02-20 19:57:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 572 transitions. [2022-02-20 19:57:09,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 572 transitions. [2022-02-20 19:57:10,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:10,464 INFO L225 Difference]: With dead ends: 3374 [2022-02-20 19:57:10,464 INFO L226 Difference]: Without dead ends: 3246 [2022-02-20 19:57:10,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:10,466 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 396 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:10,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 658 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-02-20 19:57:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2022-02-20 19:57:10,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:10,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3246 states. Second operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:10,675 INFO L74 IsIncluded]: Start isIncluded. First operand 3246 states. Second operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:10,679 INFO L87 Difference]: Start difference. First operand 3246 states. Second operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,011 INFO L93 Difference]: Finished difference Result 3246 states and 4071 transitions. [2022-02-20 19:57:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4071 transitions. [2022-02-20 19:57:11,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:11,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:11,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3246 states. [2022-02-20 19:57:11,022 INFO L87 Difference]: Start difference. First operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) Second operand 3246 states. [2022-02-20 19:57:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,349 INFO L93 Difference]: Finished difference Result 3246 states and 4071 transitions. [2022-02-20 19:57:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4071 transitions. [2022-02-20 19:57:11,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:11,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:11,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:11,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-02-20 19:57:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2022-02-20 19:57:11,820 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2022-02-20 19:57:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:11,820 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2022-02-20 19:57:11,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2022-02-20 19:57:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:11,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:11,821 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] [2022-02-20 19:57:11,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:11,822 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2022-02-20 19:57:11,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:11,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284576675] [2022-02-20 19:57:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,845 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {73754#true} {73756#(= ~M_E~0 2)} #817#return; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume true; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,870 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73801#(= |old(~M_E~0)| 0)} {73756#(= ~M_E~0 2)} #819#return; {73755#false} is VALID [2022-02-20 19:57:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {73802#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {73754#true} is VALID [2022-02-20 19:57:11,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {73754#true} assume !(1 == ~m_pc~0); {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {73754#true} is_master_triggered_~__retres1~4#1 := 0; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {73754#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {73754#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {73754#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {73754#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {73754#true} assume 1 == ~t1_pc~0; {73754#true} is VALID [2022-02-20 19:57:11,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {73754#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {73754#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {73754#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {73754#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {73754#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {73754#true} assume !(1 == ~t2_pc~0); {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {73754#true} is_transmit2_triggered_~__retres1~6#1 := 0; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {73754#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {73754#true} is VALID [2022-02-20 19:57:11,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {73754#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {73754#true} is VALID [2022-02-20 19:57:11,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {73754#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,886 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {73754#true} {73755#false} #821#return; {73755#false} is VALID [2022-02-20 19:57:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {73754#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {73754#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {73754#true} assume !(1 == ~E_M~0); {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {73754#true} assume 1 == ~E_1~0;~E_1~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {73754#true} assume 1 == ~E_2~0;~E_2~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,891 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73754#true} {73755#false} #823#return; {73755#false} is VALID [2022-02-20 19:57:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {73754#true} havoc ~__retres1~7; {73754#true} is VALID [2022-02-20 19:57:11,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {73754#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {73754#true} is VALID [2022-02-20 19:57:11,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {73754#true} #res := ~__retres1~7; {73754#true} is VALID [2022-02-20 19:57:11,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,896 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73754#true} {73755#false} #825#return; {73755#false} is VALID [2022-02-20 19:57:11,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {73754#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {73756#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {73756#(= ~M_E~0 2)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {73756#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {73756#(= ~M_E~0 2)} call update_channels2(); {73754#true} is VALID [2022-02-20 19:57:11,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,900 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {73754#true} {73756#(= ~M_E~0 2)} #817#return; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {73756#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {73756#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {73756#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {73756#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {73756#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {73756#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:11,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {73756#(= ~M_E~0 2)} call fire_delta_events2(); {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:11,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {73801#(= |old(~M_E~0)| 0)} assume true; {73801#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:11,905 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {73801#(= |old(~M_E~0)| 0)} {73756#(= ~M_E~0 2)} #819#return; {73755#false} is VALID [2022-02-20 19:57:11,905 INFO L272 TraceCheckUtils]: 21: Hoare triple {73755#false} call activate_threads2(); {73802#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:11,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {73802#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {73754#true} is VALID [2022-02-20 19:57:11,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {73754#true} assume !(1 == ~m_pc~0); {73754#true} is VALID [2022-02-20 19:57:11,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {73754#true} is_master_triggered_~__retres1~4#1 := 0; {73754#true} is VALID [2022-02-20 19:57:11,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {73754#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {73754#true} is VALID [2022-02-20 19:57:11,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {73754#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {73754#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {73754#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {73754#true} assume 1 == ~t1_pc~0; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {73754#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {73754#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {73754#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {73754#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {73754#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {73754#true} assume !(1 == ~t2_pc~0); {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {73754#true} is_transmit2_triggered_~__retres1~6#1 := 0; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {73754#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {73754#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {73754#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,907 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {73754#true} {73755#false} #821#return; {73755#false} is VALID [2022-02-20 19:57:11,908 INFO L272 TraceCheckUtils]: 42: Hoare triple {73755#false} call reset_delta_events2(); {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {73800#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {73754#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {73754#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {73754#true} assume !(1 == ~E_M~0); {73754#true} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {73754#true} assume 1 == ~E_1~0;~E_1~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {73754#true} assume 1 == ~E_2~0;~E_2~0 := 2; {73754#true} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,909 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {73754#true} {73755#false} #823#return; {73755#false} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {73755#false} assume !false; {73755#false} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {73755#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {73755#false} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {73755#false} assume !false; {73755#false} is VALID [2022-02-20 19:57:11,909 INFO L272 TraceCheckUtils]: 54: Hoare triple {73755#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {73754#true} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {73754#true} havoc ~__retres1~7; {73754#true} is VALID [2022-02-20 19:57:11,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {73754#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {73754#true} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {73754#true} #res := ~__retres1~7; {73754#true} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {73754#true} assume true; {73754#true} is VALID [2022-02-20 19:57:11,910 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {73754#true} {73755#false} #825#return; {73755#false} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {73755#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {73755#false} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {73755#false} assume 0 != eval2_~tmp~5#1; {73755#false} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {73755#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {73755#false} is VALID [2022-02-20 19:57:11,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {73755#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {73755#false} is VALID [2022-02-20 19:57:11,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {73755#false} assume !(0 == ~m_pc~0); {73755#false} is VALID [2022-02-20 19:57:11,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {73755#false} assume 1 == ~m_pc~0; {73755#false} is VALID [2022-02-20 19:57:11,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {73755#false} assume ~token~0 != 2 + ~local~0; {73755#false} is VALID [2022-02-20 19:57:11,911 INFO L272 TraceCheckUtils]: 67: Hoare triple {73755#false} call error2(); {73755#false} is VALID [2022-02-20 19:57:11,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {73755#false} assume !false; {73755#false} is VALID [2022-02-20 19:57:11,911 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:11,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:11,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284576675] [2022-02-20 19:57:11,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284576675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:11,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:11,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:11,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464284189] [2022-02-20 19:57:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:11,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:11,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:11,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:11,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:11,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:11,954 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:14,193 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2022-02-20 19:57:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 798 transitions. [2022-02-20 19:57:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 798 transitions. [2022-02-20 19:57:14,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 798 transitions. [2022-02-20 19:57:14,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:15,192 INFO L225 Difference]: With dead ends: 3524 [2022-02-20 19:57:15,193 INFO L226 Difference]: Without dead ends: 3400 [2022-02-20 19:57:15,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:15,194 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 637 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:15,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 853 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:57:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-02-20 19:57:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2022-02-20 19:57:15,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:15,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3400 states. Second operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:15,409 INFO L74 IsIncluded]: Start isIncluded. First operand 3400 states. Second operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:15,413 INFO L87 Difference]: Start difference. First operand 3400 states. Second operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:15,767 INFO L93 Difference]: Finished difference Result 3400 states and 4299 transitions. [2022-02-20 19:57:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4299 transitions. [2022-02-20 19:57:15,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:15,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:15,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) Second operand 3400 states. [2022-02-20 19:57:15,780 INFO L87 Difference]: Start difference. First operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) Second operand 3400 states. [2022-02-20 19:57:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,135 INFO L93 Difference]: Finished difference Result 3400 states and 4299 transitions. [2022-02-20 19:57:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4299 transitions. [2022-02-20 19:57:16,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:16,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-02-20 19:57:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2022-02-20 19:57:16,678 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2022-02-20 19:57:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:16,678 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2022-02-20 19:57:16,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2022-02-20 19:57:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:16,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:16,679 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] [2022-02-20 19:57:16,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:16,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2022-02-20 19:57:16,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:16,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650946690] [2022-02-20 19:57:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,700 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {89856#true} {89858#(= ~T1_E~0 ~M_E~0)} #817#return; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {89903#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:16,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {89903#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,725 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {89858#(= ~T1_E~0 ~M_E~0)} #819#return; {89857#false} is VALID [2022-02-20 19:57:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {89905#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {89856#true} assume !(1 == ~m_pc~0); {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {89856#true} is_master_triggered_~__retres1~4#1 := 0; {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {89856#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {89856#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {89856#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {89856#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {89856#true} assume 1 == ~t1_pc~0; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {89856#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {89856#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {89856#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {89856#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {89856#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {89856#true} assume !(1 == ~t2_pc~0); {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {89856#true} is_transmit2_triggered_~__retres1~6#1 := 0; {89856#true} is VALID [2022-02-20 19:57:16,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {89856#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89856#true} is VALID [2022-02-20 19:57:16,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {89856#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {89856#true} is VALID [2022-02-20 19:57:16,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {89856#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,740 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {89856#true} {89857#false} #821#return; {89857#false} is VALID [2022-02-20 19:57:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {89856#true} is VALID [2022-02-20 19:57:16,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {89856#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {89856#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {89856#true} assume !(1 == ~E_M~0); {89856#true} is VALID [2022-02-20 19:57:16,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {89856#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {89856#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,745 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89856#true} {89857#false} #823#return; {89857#false} is VALID [2022-02-20 19:57:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {89856#true} havoc ~__retres1~7; {89856#true} is VALID [2022-02-20 19:57:16,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {89856#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {89856#true} is VALID [2022-02-20 19:57:16,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {89856#true} #res := ~__retres1~7; {89856#true} is VALID [2022-02-20 19:57:16,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,749 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89856#true} {89857#false} #825#return; {89857#false} is VALID [2022-02-20 19:57:16,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {89856#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {89856#true} is VALID [2022-02-20 19:57:16,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,751 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {89856#true} {89858#(= ~T1_E~0 ~M_E~0)} #817#return; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {89858#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:57:16,753 INFO L272 TraceCheckUtils]: 12: Hoare triple {89858#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:16,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {89903#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:16,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {89903#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:16,755 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {89904#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {89858#(= ~T1_E~0 ~M_E~0)} #819#return; {89857#false} is VALID [2022-02-20 19:57:16,755 INFO L272 TraceCheckUtils]: 21: Hoare triple {89857#false} call activate_threads2(); {89905#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {89905#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {89856#true} assume !(1 == ~m_pc~0); {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {89856#true} is_master_triggered_~__retres1~4#1 := 0; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {89856#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {89856#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {89856#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {89856#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {89856#true} is VALID [2022-02-20 19:57:16,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {89856#true} assume 1 == ~t1_pc~0; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {89856#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {89856#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {89856#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {89856#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {89856#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {89856#true} assume !(1 == ~t2_pc~0); {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {89856#true} is_transmit2_triggered_~__retres1~6#1 := 0; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {89856#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89856#true} is VALID [2022-02-20 19:57:16,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {89856#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {89856#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {89856#true} {89857#false} #821#return; {89857#false} is VALID [2022-02-20 19:57:16,758 INFO L272 TraceCheckUtils]: 42: Hoare triple {89857#false} call reset_delta_events2(); {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {89902#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {89856#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {89856#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {89856#true} assume !(1 == ~E_M~0); {89856#true} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {89856#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {89856#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89856#true} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,759 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {89856#true} {89857#false} #823#return; {89857#false} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {89857#false} assume !false; {89857#false} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {89857#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {89857#false} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {89857#false} assume !false; {89857#false} is VALID [2022-02-20 19:57:16,759 INFO L272 TraceCheckUtils]: 54: Hoare triple {89857#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {89856#true} is VALID [2022-02-20 19:57:16,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {89856#true} havoc ~__retres1~7; {89856#true} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {89856#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {89856#true} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {89856#true} #res := ~__retres1~7; {89856#true} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {89856#true} assume true; {89856#true} is VALID [2022-02-20 19:57:16,760 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {89856#true} {89857#false} #825#return; {89857#false} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {89857#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {89857#false} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {89857#false} assume 0 != eval2_~tmp~5#1; {89857#false} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {89857#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {89857#false} is VALID [2022-02-20 19:57:16,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {89857#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {89857#false} assume !(0 == ~m_pc~0); {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {89857#false} assume 1 == ~m_pc~0; {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {89857#false} assume ~token~0 != 2 + ~local~0; {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L272 TraceCheckUtils]: 67: Hoare triple {89857#false} call error2(); {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {89857#false} assume !false; {89857#false} is VALID [2022-02-20 19:57:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:16,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:16,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650946690] [2022-02-20 19:57:16,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650946690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:16,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:16,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:16,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751689636] [2022-02-20 19:57:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:16,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:16,763 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), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:16,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:16,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:16,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:16,799 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:19,734 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2022-02-20 19:57:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 798 transitions. [2022-02-20 19:57:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 798 transitions. [2022-02-20 19:57:19,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 798 transitions. [2022-02-20 19:57:20,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:20,759 INFO L225 Difference]: With dead ends: 3797 [2022-02-20 19:57:20,759 INFO L226 Difference]: Without dead ends: 3552 [2022-02-20 19:57:20,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:20,761 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 629 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:20,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 1321 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-02-20 19:57:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2022-02-20 19:57:20,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:20,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3552 states. Second operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:20,977 INFO L74 IsIncluded]: Start isIncluded. First operand 3552 states. Second operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:20,981 INFO L87 Difference]: Start difference. First operand 3552 states. Second operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,357 INFO L93 Difference]: Finished difference Result 3552 states and 4525 transitions. [2022-02-20 19:57:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 4525 transitions. [2022-02-20 19:57:21,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3552 states. [2022-02-20 19:57:21,370 INFO L87 Difference]: Start difference. First operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3552 states. [2022-02-20 19:57:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,751 INFO L93 Difference]: Finished difference Result 3552 states and 4525 transitions. [2022-02-20 19:57:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 4525 transitions. [2022-02-20 19:57:21,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:21,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2022-02-20 19:57:22,316 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2022-02-20 19:57:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:22,317 INFO L470 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2022-02-20 19:57:22,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2022-02-20 19:57:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:22,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:22,318 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] [2022-02-20 19:57:22,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:57:22,319 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2022-02-20 19:57:22,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:22,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075231022] [2022-02-20 19:57:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,345 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {106775#true} {106777#(not (= ~E_M~0 0))} #817#return; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume true; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,375 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {106823#(= |old(~E_M~0)| 0)} {106777#(not (= ~E_M~0 0))} #819#return; {106776#false} is VALID [2022-02-20 19:57:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {106824#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {106775#true} assume !(1 == ~m_pc~0); {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {106775#true} is_master_triggered_~__retres1~4#1 := 0; {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {106775#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {106775#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {106775#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {106775#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {106775#true} assume 1 == ~t1_pc~0; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {106775#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {106775#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {106775#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {106775#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {106775#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {106775#true} is VALID [2022-02-20 19:57:22,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {106775#true} assume !(1 == ~t2_pc~0); {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {106775#true} is_transmit2_triggered_~__retres1~6#1 := 0; {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {106775#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {106775#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {106775#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,391 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {106775#true} {106776#false} #821#return; {106776#false} is VALID [2022-02-20 19:57:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {106775#true} is VALID [2022-02-20 19:57:22,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {106775#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {106775#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {106775#true} assume !(1 == ~E_M~0); {106775#true} is VALID [2022-02-20 19:57:22,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {106775#true} assume 1 == ~E_1~0;~E_1~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {106775#true} assume 1 == ~E_2~0;~E_2~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {106775#true} {106776#false} #823#return; {106776#false} is VALID [2022-02-20 19:57:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:22,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {106775#true} havoc ~__retres1~7; {106775#true} is VALID [2022-02-20 19:57:22,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {106775#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {106775#true} is VALID [2022-02-20 19:57:22,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {106775#true} #res := ~__retres1~7; {106775#true} is VALID [2022-02-20 19:57:22,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,400 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {106775#true} {106776#false} #825#return; {106776#false} is VALID [2022-02-20 19:57:22,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {106775#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {106777#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {106777#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {106777#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {106777#(not (= ~E_M~0 0))} call update_channels2(); {106775#true} is VALID [2022-02-20 19:57:22,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,402 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {106775#true} {106777#(not (= ~E_M~0 0))} #817#return; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {106777#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {106777#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {106777#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {106777#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {106777#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {106777#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:57:22,404 INFO L272 TraceCheckUtils]: 12: Hoare triple {106777#(not (= ~E_M~0 0))} call fire_delta_events2(); {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:22,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {106822#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:57:22,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {106822#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {106823#(= |old(~E_M~0)| 0)} assume true; {106823#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:57:22,407 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {106823#(= |old(~E_M~0)| 0)} {106777#(not (= ~E_M~0 0))} #819#return; {106776#false} is VALID [2022-02-20 19:57:22,407 INFO L272 TraceCheckUtils]: 21: Hoare triple {106776#false} call activate_threads2(); {106824#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:22,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {106824#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {106775#true} assume !(1 == ~m_pc~0); {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {106775#true} is_master_triggered_~__retres1~4#1 := 0; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {106775#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {106775#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {106775#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {106775#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {106775#true} assume 1 == ~t1_pc~0; {106775#true} is VALID [2022-02-20 19:57:22,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {106775#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {106775#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {106775#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {106775#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {106775#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {106775#true} assume !(1 == ~t2_pc~0); {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {106775#true} is_transmit2_triggered_~__retres1~6#1 := 0; {106775#true} is VALID [2022-02-20 19:57:22,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {106775#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {106775#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {106775#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106775#true} {106776#false} #821#return; {106776#false} is VALID [2022-02-20 19:57:22,410 INFO L272 TraceCheckUtils]: 42: Hoare triple {106776#false} call reset_delta_events2(); {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {106821#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {106775#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {106775#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {106775#true} assume !(1 == ~E_M~0); {106775#true} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {106775#true} assume 1 == ~E_1~0;~E_1~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {106775#true} assume 1 == ~E_2~0;~E_2~0 := 2; {106775#true} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,411 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {106775#true} {106776#false} #823#return; {106776#false} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {106776#false} assume !false; {106776#false} is VALID [2022-02-20 19:57:22,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {106776#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {106776#false} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {106776#false} assume !false; {106776#false} is VALID [2022-02-20 19:57:22,412 INFO L272 TraceCheckUtils]: 54: Hoare triple {106776#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {106775#true} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 55: Hoare triple {106775#true} havoc ~__retres1~7; {106775#true} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {106775#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {106775#true} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {106775#true} #res := ~__retres1~7; {106775#true} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {106775#true} assume true; {106775#true} is VALID [2022-02-20 19:57:22,412 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {106775#true} {106776#false} #825#return; {106776#false} is VALID [2022-02-20 19:57:22,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {106776#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {106776#false} assume 0 != eval2_~tmp~5#1; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {106776#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {106776#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {106776#false} assume !(0 == ~m_pc~0); {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {106776#false} assume 1 == ~m_pc~0; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {106776#false} assume ~token~0 != 2 + ~local~0; {106776#false} is VALID [2022-02-20 19:57:22,413 INFO L272 TraceCheckUtils]: 67: Hoare triple {106776#false} call error2(); {106776#false} is VALID [2022-02-20 19:57:22,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {106776#false} assume !false; {106776#false} is VALID [2022-02-20 19:57:22,414 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:22,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:22,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075231022] [2022-02-20 19:57:22,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075231022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:22,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:22,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:22,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409448242] [2022-02-20 19:57:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:22,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:22,416 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), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:22,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:22,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:22,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:22,455 INFO L87 Difference]: Start difference. First operand 3449 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:24,557 INFO L93 Difference]: Finished difference Result 3907 states and 5057 transitions. [2022-02-20 19:57:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:57:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2022-02-20 19:57:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2022-02-20 19:57:24,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 573 transitions. [2022-02-20 19:57:24,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:25,393 INFO L225 Difference]: With dead ends: 3907 [2022-02-20 19:57:25,393 INFO L226 Difference]: Without dead ends: 3548 [2022-02-20 19:57:25,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:25,395 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 539 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:25,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 830 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-02-20 19:57:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3449. [2022-02-20 19:57:25,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:25,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3548 states. Second operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:25,588 INFO L74 IsIncluded]: Start isIncluded. First operand 3548 states. Second operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:25,591 INFO L87 Difference]: Start difference. First operand 3548 states. Second operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:25,972 INFO L93 Difference]: Finished difference Result 3548 states and 4518 transitions. [2022-02-20 19:57:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 4518 transitions. [2022-02-20 19:57:25,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:25,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:25,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3548 states. [2022-02-20 19:57:25,983 INFO L87 Difference]: Start difference. First operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) Second operand 3548 states. [2022-02-20 19:57:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:26,368 INFO L93 Difference]: Finished difference Result 3548 states and 4518 transitions. [2022-02-20 19:57:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 4518 transitions. [2022-02-20 19:57:26,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:26,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:26,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:26,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-02-20 19:57:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4360 transitions. [2022-02-20 19:57:26,899 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4360 transitions. Word has length 69 [2022-02-20 19:57:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:26,899 INFO L470 AbstractCegarLoop]: Abstraction has 3449 states and 4360 transitions. [2022-02-20 19:57:26,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4360 transitions. [2022-02-20 19:57:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:26,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:26,900 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] [2022-02-20 19:57:26,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:57:26,900 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2022-02-20 19:57:26,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:26,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882152737] [2022-02-20 19:57:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:26,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:26,950 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {123819#true} {123821#(= ~E_1~0 ~M_E~0)} #817#return; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:26,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:26,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:26,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:26,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:26,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:26,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:26,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:26,976 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {123821#(= ~E_1~0 ~M_E~0)} #819#return; {123820#false} is VALID [2022-02-20 19:57:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:26,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {123868#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {123819#true} assume !(1 == ~m_pc~0); {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {123819#true} is_master_triggered_~__retres1~4#1 := 0; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {123819#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {123819#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {123819#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {123819#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {123819#true} assume 1 == ~t1_pc~0; {123819#true} is VALID [2022-02-20 19:57:26,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {123819#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {123819#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {123819#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {123819#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {123819#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {123819#true} assume !(1 == ~t2_pc~0); {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {123819#true} is_transmit2_triggered_~__retres1~6#1 := 0; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {123819#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {123819#true} is VALID [2022-02-20 19:57:26,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {123819#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {123819#true} is VALID [2022-02-20 19:57:26,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {123819#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:26,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:26,993 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {123819#true} {123820#false} #821#return; {123820#false} is VALID [2022-02-20 19:57:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {123819#true} is VALID [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {123819#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {123819#true} is VALID [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {123819#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {123819#true} is VALID [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {123819#true} assume !(1 == ~E_M~0); {123819#true} is VALID [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {123819#true} assume 1 == ~E_1~0;~E_1~0 := 2; {123819#true} is VALID [2022-02-20 19:57:26,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {123819#true} assume 1 == ~E_2~0;~E_2~0 := 2; {123819#true} is VALID [2022-02-20 19:57:26,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:26,997 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {123819#true} {123820#false} #823#return; {123820#false} is VALID [2022-02-20 19:57:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {123819#true} havoc ~__retres1~7; {123819#true} is VALID [2022-02-20 19:57:27,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {123819#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {123819#true} is VALID [2022-02-20 19:57:27,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {123819#true} #res := ~__retres1~7; {123819#true} is VALID [2022-02-20 19:57:27,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:27,003 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {123819#true} {123820#false} #825#return; {123820#false} is VALID [2022-02-20 19:57:27,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {123819#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} call update_channels2(); {123819#true} is VALID [2022-02-20 19:57:27,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:27,005 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {123819#true} {123821#(= ~E_1~0 ~M_E~0)} #817#return; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {123821#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:57:27,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {123821#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:27,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:27,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:27,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:27,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:27,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {123866#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:27,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:27,009 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {123867#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {123821#(= ~E_1~0 ~M_E~0)} #819#return; {123820#false} is VALID [2022-02-20 19:57:27,009 INFO L272 TraceCheckUtils]: 21: Hoare triple {123820#false} call activate_threads2(); {123868#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:27,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {123868#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {123819#true} assume !(1 == ~m_pc~0); {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {123819#true} is_master_triggered_~__retres1~4#1 := 0; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {123819#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {123819#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {123819#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {123819#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {123819#true} assume 1 == ~t1_pc~0; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {123819#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {123819#true} is VALID [2022-02-20 19:57:27,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {123819#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {123819#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {123819#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {123819#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {123819#true} assume !(1 == ~t2_pc~0); {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {123819#true} is_transmit2_triggered_~__retres1~6#1 := 0; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {123819#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {123819#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {123819#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {123819#true} is VALID [2022-02-20 19:57:27,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:27,012 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {123819#true} {123820#false} #821#return; {123820#false} is VALID [2022-02-20 19:57:27,012 INFO L272 TraceCheckUtils]: 42: Hoare triple {123820#false} call reset_delta_events2(); {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {123865#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {123819#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {123819#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {123819#true} assume !(1 == ~E_M~0); {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {123819#true} assume 1 == ~E_1~0;~E_1~0 := 2; {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {123819#true} assume 1 == ~E_2~0;~E_2~0 := 2; {123819#true} is VALID [2022-02-20 19:57:27,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {123819#true} {123820#false} #823#return; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {123820#false} assume !false; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {123820#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {123820#false} assume !false; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L272 TraceCheckUtils]: 54: Hoare triple {123820#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {123819#true} havoc ~__retres1~7; {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {123819#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {123819#true} #res := ~__retres1~7; {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {123819#true} assume true; {123819#true} is VALID [2022-02-20 19:57:27,028 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {123819#true} {123820#false} #825#return; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 60: Hoare triple {123820#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 61: Hoare triple {123820#false} assume 0 != eval2_~tmp~5#1; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 62: Hoare triple {123820#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {123820#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {123820#false} assume !(0 == ~m_pc~0); {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {123820#false} assume 1 == ~m_pc~0; {123820#false} is VALID [2022-02-20 19:57:27,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {123820#false} assume ~token~0 != 2 + ~local~0; {123820#false} is VALID [2022-02-20 19:57:27,029 INFO L272 TraceCheckUtils]: 67: Hoare triple {123820#false} call error2(); {123820#false} is VALID [2022-02-20 19:57:27,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {123820#false} assume !false; {123820#false} is VALID [2022-02-20 19:57:27,029 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:27,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:27,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882152737] [2022-02-20 19:57:27,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882152737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:27,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:27,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:27,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037082164] [2022-02-20 19:57:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:27,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:27,030 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), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:27,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:27,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:27,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:27,068 INFO L87 Difference]: Start difference. First operand 3449 states and 4360 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,142 INFO L93 Difference]: Finished difference Result 4243 states and 5535 transitions. [2022-02-20 19:57:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:57:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 831 transitions. [2022-02-20 19:57:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 831 transitions. [2022-02-20 19:57:30,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 831 transitions. [2022-02-20 19:57:30,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:31,326 INFO L225 Difference]: With dead ends: 4243 [2022-02-20 19:57:31,326 INFO L226 Difference]: Without dead ends: 3884 [2022-02-20 19:57:31,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:31,328 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 1289 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-02-20 19:57:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3658. [2022-02-20 19:57:31,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:31,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3884 states. Second operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-02-20 19:57:31,575 INFO L74 IsIncluded]: Start isIncluded. First operand 3884 states. Second operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-02-20 19:57:31,578 INFO L87 Difference]: Start difference. First operand 3884 states. Second operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-02-20 19:57:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:32,027 INFO L93 Difference]: Finished difference Result 3884 states and 5001 transitions. [2022-02-20 19:57:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5001 transitions. [2022-02-20 19:57:32,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:32,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:32,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) Second operand 3884 states. [2022-02-20 19:57:32,037 INFO L87 Difference]: Start difference. First operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) Second operand 3884 states. [2022-02-20 19:57:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:32,490 INFO L93 Difference]: Finished difference Result 3884 states and 5001 transitions. [2022-02-20 19:57:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5001 transitions. [2022-02-20 19:57:32,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:32,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:32,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:32,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-02-20 19:57:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4661 transitions. [2022-02-20 19:57:33,118 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4661 transitions. Word has length 69 [2022-02-20 19:57:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:33,118 INFO L470 AbstractCegarLoop]: Abstraction has 3658 states and 4661 transitions. [2022-02-20 19:57:33,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4661 transitions. [2022-02-20 19:57:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:57:33,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:33,120 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] [2022-02-20 19:57:33,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 19:57:33,120 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2022-02-20 19:57:33,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:33,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586806063] [2022-02-20 19:57:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,139 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {142258#true} {142260#(= ~E_2~0 ~M_E~0)} #817#return; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:33,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:33,162 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {142260#(= ~E_2~0 ~M_E~0)} #819#return; {142259#false} is VALID [2022-02-20 19:57:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:57:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {142307#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {142258#true} is VALID [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {142258#true} assume !(1 == ~m_pc~0); {142258#true} is VALID [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {142258#true} is_master_triggered_~__retres1~4#1 := 0; {142258#true} is VALID [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {142258#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {142258#true} is VALID [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {142258#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {142258#true} is VALID [2022-02-20 19:57:33,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {142258#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {142258#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {142258#true} assume 1 == ~t1_pc~0; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {142258#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {142258#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {142258#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {142258#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {142258#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {142258#true} is VALID [2022-02-20 19:57:33,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {142258#true} assume !(1 == ~t2_pc~0); {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {142258#true} is_transmit2_triggered_~__retres1~6#1 := 0; {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {142258#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {142258#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {142258#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,175 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {142258#true} {142259#false} #821#return; {142259#false} is VALID [2022-02-20 19:57:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:57:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {142258#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {142258#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {142258#true} assume !(1 == ~E_M~0); {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {142258#true} assume 1 == ~E_1~0;~E_1~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {142258#true} assume 1 == ~E_2~0;~E_2~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,179 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {142258#true} {142259#false} #823#return; {142259#false} is VALID [2022-02-20 19:57:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:57:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {142258#true} havoc ~__retres1~7; {142258#true} is VALID [2022-02-20 19:57:33,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {142258#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {142258#true} is VALID [2022-02-20 19:57:33,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {142258#true} #res := ~__retres1~7; {142258#true} is VALID [2022-02-20 19:57:33,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,182 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {142258#true} {142259#false} #825#return; {142259#false} is VALID [2022-02-20 19:57:33,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {142258#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} call update_channels2(); {142258#true} is VALID [2022-02-20 19:57:33,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,185 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {142258#true} {142260#(= ~E_2~0 ~M_E~0)} #817#return; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {142260#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:57:33,195 INFO L272 TraceCheckUtils]: 12: Hoare triple {142260#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:33,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:57:33,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {142305#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:33,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:57:33,198 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {142306#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {142260#(= ~E_2~0 ~M_E~0)} #819#return; {142259#false} is VALID [2022-02-20 19:57:33,198 INFO L272 TraceCheckUtils]: 21: Hoare triple {142259#false} call activate_threads2(); {142307#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:57:33,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {142307#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {142258#true} assume !(1 == ~m_pc~0); {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {142258#true} is_master_triggered_~__retres1~4#1 := 0; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {142258#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {142258#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {142258#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {142258#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {142258#true} is VALID [2022-02-20 19:57:33,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {142258#true} assume 1 == ~t1_pc~0; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {142258#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {142258#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {142258#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {142258#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {142258#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {142258#true} assume !(1 == ~t2_pc~0); {142258#true} is VALID [2022-02-20 19:57:33,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {142258#true} is_transmit2_triggered_~__retres1~6#1 := 0; {142258#true} is VALID [2022-02-20 19:57:33,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {142258#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {142258#true} is VALID [2022-02-20 19:57:33,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {142258#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {142258#true} is VALID [2022-02-20 19:57:33,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {142258#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {142258#true} is VALID [2022-02-20 19:57:33,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,201 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {142258#true} {142259#false} #821#return; {142259#false} is VALID [2022-02-20 19:57:33,201 INFO L272 TraceCheckUtils]: 42: Hoare triple {142259#false} call reset_delta_events2(); {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:57:33,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {142304#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {142258#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {142258#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {142258#true} assume !(1 == ~E_M~0); {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {142258#true} assume 1 == ~E_1~0;~E_1~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {142258#true} assume 1 == ~E_2~0;~E_2~0 := 2; {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,202 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {142258#true} {142259#false} #823#return; {142259#false} is VALID [2022-02-20 19:57:33,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {142259#false} assume !false; {142259#false} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {142259#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {142259#false} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {142259#false} assume !false; {142259#false} is VALID [2022-02-20 19:57:33,203 INFO L272 TraceCheckUtils]: 54: Hoare triple {142259#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {142258#true} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {142258#true} havoc ~__retres1~7; {142258#true} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {142258#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {142258#true} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {142258#true} #res := ~__retres1~7; {142258#true} is VALID [2022-02-20 19:57:33,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {142258#true} assume true; {142258#true} is VALID [2022-02-20 19:57:33,204 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {142258#true} {142259#false} #825#return; {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 60: Hoare triple {142259#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {142259#false} assume 0 != eval2_~tmp~5#1; {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {142259#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {142259#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {142259#false} assume !(0 == ~m_pc~0); {142259#false} is VALID [2022-02-20 19:57:33,204 INFO L290 TraceCheckUtils]: 65: Hoare triple {142259#false} assume 1 == ~m_pc~0; {142259#false} is VALID [2022-02-20 19:57:33,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {142259#false} assume ~token~0 != 2 + ~local~0; {142259#false} is VALID [2022-02-20 19:57:33,205 INFO L272 TraceCheckUtils]: 67: Hoare triple {142259#false} call error2(); {142259#false} is VALID [2022-02-20 19:57:33,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {142259#false} assume !false; {142259#false} is VALID [2022-02-20 19:57:33,205 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:33,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:33,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586806063] [2022-02-20 19:57:33,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586806063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:33,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:33,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:33,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813663408] [2022-02-20 19:57:33,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:33,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:33,207 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), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:33,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:33,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:33,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:33,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:33,248 INFO L87 Difference]: Start difference. First operand 3658 states and 4661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,848 INFO L93 Difference]: Finished difference Result 4946 states and 6542 transitions. [2022-02-20 19:57:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:57:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:57:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 810 transitions. [2022-02-20 19:57:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 810 transitions. [2022-02-20 19:57:36,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 810 transitions. [2022-02-20 19:57:37,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 810 edges. 810 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:38,152 INFO L225 Difference]: With dead ends: 4946 [2022-02-20 19:57:38,152 INFO L226 Difference]: Without dead ends: 4378 [2022-02-20 19:57:38,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:38,154 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 618 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:38,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 1301 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-02-20 19:57:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4089. [2022-02-20 19:57:38,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:38,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4378 states. Second operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-02-20 19:57:38,407 INFO L74 IsIncluded]: Start isIncluded. First operand 4378 states. Second operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-02-20 19:57:38,410 INFO L87 Difference]: Start difference. First operand 4378 states. Second operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609)