./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.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_1.cil-2+token_ring.03.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 a0f469ae37a514ddca8d0dce53a0af7478c9ef70fff43265912fb6cefbfb3984 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:54:41,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:54:41,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:54:41,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:54:41,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:54:41,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:54:41,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:54:41,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:54:41,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:54:41,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:54:41,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:54:41,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:54:41,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:54:41,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:54:41,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:54:41,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:54:41,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:54:41,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:54:41,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:54:41,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:54:41,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:54:41,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:54:41,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:54:41,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:54:41,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:54:41,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:54:41,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:54:41,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:54:41,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:54:41,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:54:41,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:54:41,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:54:41,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:54:41,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:54:41,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:54:41,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:54:41,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:54:41,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:54:41,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:54:41,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:54:41,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:54:41,747 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:54:41,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:54:41,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:54:41,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:54:41,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:54:41,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:54:41,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:54:41,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:54:41,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:54:41,785 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:54:41,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:54:41,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:54:41,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:54:41,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:54:41,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:54:41,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:54:41,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:54:41,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:54:41,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:54:41,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:54:41,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:54:41,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:54:41,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:54:41,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:54:41,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:54:41,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:41,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:54:41,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:54:41,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:54:41,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:54:41,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:54:41,790 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:54:41,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:54:41,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:54:41,791 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 -> a0f469ae37a514ddca8d0dce53a0af7478c9ef70fff43265912fb6cefbfb3984 [2022-02-20 19:54:42,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:54:42,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:54:42,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:54:42,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:54:42,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:54:42,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2022-02-20 19:54:42,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f2a6a7d/b464bfdf139347c78ff7618cd12cafc6/FLAG30ec5199c [2022-02-20 19:54:42,579 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:54:42,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2022-02-20 19:54:42,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f2a6a7d/b464bfdf139347c78ff7618cd12cafc6/FLAG30ec5199c [2022-02-20 19:54:42,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f2a6a7d/b464bfdf139347c78ff7618cd12cafc6 [2022-02-20 19:54:42,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:54:42,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:54:42,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:42,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:54:42,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:54:42,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:42,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84f135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42, skipping insertion in model container [2022-02-20 19:54:42,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:42,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:54:42,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:54:42,772 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_1.cil-2+token_ring.03.cil-2.c[913,926] [2022-02-20 19:54:42,809 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_1.cil-2+token_ring.03.cil-2.c[5977,5990] [2022-02-20 19:54:42,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:42,859 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:54:42,868 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_1.cil-2+token_ring.03.cil-2.c[913,926] [2022-02-20 19:54:42,886 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_1.cil-2+token_ring.03.cil-2.c[5977,5990] [2022-02-20 19:54:42,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:42,940 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:54:42,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42 WrapperNode [2022-02-20 19:54:42,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:42,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:42,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:54:42,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:54:42,948 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:54:42" (1/1) ... [2022-02-20 19:54:42,971 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:54:42" (1/1) ... [2022-02-20 19:54:43,027 INFO L137 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 533 [2022-02-20 19:54:43,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:43,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:54:43,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:54:43,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:54:43,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:54:43,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:54:43,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:54:43,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:54:43,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:43,117 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:54:43,118 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:54:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:54:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:54:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:54:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-02-20 19:54:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-02-20 19:54:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:54:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:54:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:54:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:54:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:54:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:54:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:54:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:54:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:54:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:54:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:54:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:54:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:54:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:54:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:54:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:54:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:54:43,289 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:54:43,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:54:43,957 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:54:43,972 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:54:43,974 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:54:43,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:43 BoogieIcfgContainer [2022-02-20 19:54:43,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:54:43,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:54:43,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:54:43,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:54:43,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:54:42" (1/3) ... [2022-02-20 19:54:43,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd1827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:43, skipping insertion in model container [2022-02-20 19:54:43,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42" (2/3) ... [2022-02-20 19:54:43,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd1827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:43, skipping insertion in model container [2022-02-20 19:54:43,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:43" (3/3) ... [2022-02-20 19:54:43,983 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2022-02-20 19:54:43,987 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:54:43,988 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:54:44,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:54:44,046 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:54:44,046 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:54:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 194 states have (on average 1.5824742268041236) internal successors, (307), 199 states have internal predecessors, (307), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 19:54:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:54:44,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:44,085 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] [2022-02-20 19:54:44,086 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1071236690, now seen corresponding path program 1 times [2022-02-20 19:54:44,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:44,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160673742] [2022-02-20 19:54:44,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#true} havoc ~__retres1~2; {232#true} is VALID [2022-02-20 19:54:44,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {234#(= ~p_dw_st~0 0)} assume true; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,364 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {234#(= ~p_dw_st~0 0)} {234#(= ~p_dw_st~0 0)} #814#return; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:54:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {232#true} is VALID [2022-02-20 19:54:44,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume 1 == ~p_dw_pc~0; {232#true} is VALID [2022-02-20 19:54:44,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {232#true} is VALID [2022-02-20 19:54:44,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {232#true} is VALID [2022-02-20 19:54:44,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {232#true} is VALID [2022-02-20 19:54:44,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {232#true} is VALID [2022-02-20 19:54:44,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {232#true} is VALID [2022-02-20 19:54:44,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#true} assume !(1 == ~c_dr_pc~0); {232#true} is VALID [2022-02-20 19:54:44,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {232#true} is VALID [2022-02-20 19:54:44,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {232#true} is VALID [2022-02-20 19:54:44,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {232#true} is VALID [2022-02-20 19:54:44,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {232#true} is VALID [2022-02-20 19:54:44,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-02-20 19:54:44,411 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {233#false} #818#return; {233#false} is VALID [2022-02-20 19:54:44,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {232#true} is VALID [2022-02-20 19:54:44,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {232#true} is VALID [2022-02-20 19:54:44,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {232#true} is VALID [2022-02-20 19:54:44,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {232#true} is VALID [2022-02-20 19:54:44,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(= ~p_dw_st~0 0)} assume !false; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(= ~p_dw_st~0 0)} assume !false; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,419 INFO L272 TraceCheckUtils]: 10: Hoare triple {234#(= ~p_dw_st~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {232#true} is VALID [2022-02-20 19:54:44,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} havoc ~__retres1~2; {232#true} is VALID [2022-02-20 19:54:44,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {234#(= ~p_dw_st~0 0)} assume true; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {234#(= ~p_dw_st~0 0)} {234#(= ~p_dw_st~0 0)} #814#return; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {234#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {234#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {234#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {234#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {233#false} is VALID [2022-02-20 19:54:44,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {233#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {233#false} is VALID [2022-02-20 19:54:44,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume 0 != eval1_~tmp___0~1#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; {233#false} is VALID [2022-02-20 19:54:44,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {233#false} assume 0 == ~c_dr_pc~0; {233#false} is VALID [2022-02-20 19:54:44,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-02-20 19:54:44,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {233#false} assume !(1 == ~q_free~0); {233#false} is VALID [2022-02-20 19:54:44,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {233#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_read_ev~0 := 1; {233#false} is VALID [2022-02-20 19:54:44,428 INFO L272 TraceCheckUtils]: 25: Hoare triple {233#false} call immediate_notify_threads(); {254#(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:54:44,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {254#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {232#true} is VALID [2022-02-20 19:54:44,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {232#true} assume 1 == ~p_dw_pc~0; {232#true} is VALID [2022-02-20 19:54:44,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {232#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {232#true} is VALID [2022-02-20 19:54:44,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {232#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {232#true} is VALID [2022-02-20 19:54:44,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {232#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {232#true} is VALID [2022-02-20 19:54:44,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {232#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {232#true} is VALID [2022-02-20 19:54:44,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {232#true} is VALID [2022-02-20 19:54:44,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {232#true} assume !(1 == ~c_dr_pc~0); {232#true} is VALID [2022-02-20 19:54:44,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {232#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {232#true} is VALID [2022-02-20 19:54:44,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {232#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {232#true} is VALID [2022-02-20 19:54:44,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {232#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {232#true} is VALID [2022-02-20 19:54:44,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {232#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {232#true} is VALID [2022-02-20 19:54:44,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {232#true} assume true; {232#true} is VALID [2022-02-20 19:54:44,438 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {232#true} {233#false} #818#return; {233#false} is VALID [2022-02-20 19:54:44,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {233#false} ~q_read_ev~0 := 2; {233#false} is VALID [2022-02-20 19:54:44,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {233#false} assume !(~p_last_write~0 == ~c_last_read~0); {233#false} is VALID [2022-02-20 19:54:44,439 INFO L272 TraceCheckUtils]: 42: Hoare triple {233#false} call error1(); {233#false} is VALID [2022-02-20 19:54:44,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-02-20 19:54:44,440 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:54:44,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:44,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160673742] [2022-02-20 19:54:44,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160673742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:44,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:44,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:44,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777180774] [2022-02-20 19:54:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:44,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:44,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:44,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:44,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:44,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:44,544 INFO L87 Difference]: Start difference. First operand has 229 states, 194 states have (on average 1.5824742268041236) internal successors, (307), 199 states have internal predecessors, (307), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,392 INFO L93 Difference]: Finished difference Result 512 states and 792 transitions. [2022-02-20 19:54:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 792 transitions. [2022-02-20 19:54:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 792 transitions. [2022-02-20 19:54:45,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 792 transitions. [2022-02-20 19:54:46,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 792 edges. 792 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:46,106 INFO L225 Difference]: With dead ends: 512 [2022-02-20 19:54:46,106 INFO L226 Difference]: Without dead ends: 289 [2022-02-20 19:54:46,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:46,116 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 404 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:46,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 589 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-02-20 19:54:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2022-02-20 19:54:46,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:46,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,189 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,191 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,209 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2022-02-20 19:54:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 416 transitions. [2022-02-20 19:54:46,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:46,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:46,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) Second operand 289 states. [2022-02-20 19:54:46,222 INFO L87 Difference]: Start difference. First operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) Second operand 289 states. [2022-02-20 19:54:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,237 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2022-02-20 19:54:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 416 transitions. [2022-02-20 19:54:46,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:46,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:46,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:46,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 243 states have (on average 1.448559670781893) internal successors, (352), 247 states have internal predecessors, (352), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2022-02-20 19:54:46,258 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 44 [2022-02-20 19:54:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:46,259 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2022-02-20 19:54:46,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2022-02-20 19:54:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:46,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:46,262 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] [2022-02-20 19:54:46,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:54:46,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash -617941460, now seen corresponding path program 1 times [2022-02-20 19:54:46,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:46,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522506904] [2022-02-20 19:54:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1924#true} havoc ~__retres1~2; {1924#true} is VALID [2022-02-20 19:54:46,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1924#true} is VALID [2022-02-20 19:54:46,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} #res := ~__retres1~2; {1924#true} is VALID [2022-02-20 19:54:46,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-02-20 19:54:46,357 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1924#true} {1926#(= ~q_free~0 1)} #814#return; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {1946#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1924#true} is VALID [2022-02-20 19:54:46,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} assume 1 == ~p_dw_pc~0; {1924#true} is VALID [2022-02-20 19:54:46,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1924#true} is VALID [2022-02-20 19:54:46,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {1924#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1924#true} is VALID [2022-02-20 19:54:46,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1924#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1924#true} is VALID [2022-02-20 19:54:46,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1924#true} is VALID [2022-02-20 19:54:46,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1924#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1924#true} is VALID [2022-02-20 19:54:46,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1924#true} assume !(1 == ~c_dr_pc~0); {1924#true} is VALID [2022-02-20 19:54:46,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1924#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1924#true} is VALID [2022-02-20 19:54:46,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1924#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1924#true} is VALID [2022-02-20 19:54:46,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {1924#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1924#true} is VALID [2022-02-20 19:54:46,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1924#true} is VALID [2022-02-20 19:54:46,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-02-20 19:54:46,395 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1924#true} {1925#false} #818#return; {1925#false} is VALID [2022-02-20 19:54:46,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1924#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {1924#true} is VALID [2022-02-20 19:54:46,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {1924#true} is VALID [2022-02-20 19:54:46,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1926#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1926#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1926#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1926#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1926#(= ~q_free~0 1)} assume !false; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1926#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1926#(= ~q_free~0 1)} assume !false; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,399 INFO L272 TraceCheckUtils]: 10: Hoare triple {1926#(= ~q_free~0 1)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {1924#true} is VALID [2022-02-20 19:54:46,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#true} havoc ~__retres1~2; {1924#true} is VALID [2022-02-20 19:54:46,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1924#true} is VALID [2022-02-20 19:54:46,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {1924#true} #res := ~__retres1~2; {1924#true} is VALID [2022-02-20 19:54:46,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-02-20 19:54:46,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1924#true} {1926#(= ~q_free~0 1)} #814#return; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {1926#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {1926#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {1926#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {1926#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~1#1); {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {1926#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {1926#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~1#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; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {1926#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {1926#(= ~q_free~0 1)} assume !false; {1926#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {1926#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {1925#false} is VALID [2022-02-20 19:54:46,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#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_read_ev~0 := 1; {1925#false} is VALID [2022-02-20 19:54:46,411 INFO L272 TraceCheckUtils]: 26: Hoare triple {1925#false} call immediate_notify_threads(); {1946#(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:54:46,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {1946#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1924#true} is VALID [2022-02-20 19:54:46,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {1924#true} assume 1 == ~p_dw_pc~0; {1924#true} is VALID [2022-02-20 19:54:46,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {1924#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1924#true} is VALID [2022-02-20 19:54:46,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {1924#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1924#true} is VALID [2022-02-20 19:54:46,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {1924#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1924#true} is VALID [2022-02-20 19:54:46,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {1924#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1924#true} is VALID [2022-02-20 19:54:46,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {1924#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1924#true} is VALID [2022-02-20 19:54:46,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {1924#true} assume !(1 == ~c_dr_pc~0); {1924#true} is VALID [2022-02-20 19:54:46,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {1924#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1924#true} is VALID [2022-02-20 19:54:46,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {1924#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1924#true} is VALID [2022-02-20 19:54:46,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {1924#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1924#true} is VALID [2022-02-20 19:54:46,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {1924#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1924#true} is VALID [2022-02-20 19:54:46,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-02-20 19:54:46,424 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1924#true} {1925#false} #818#return; {1925#false} is VALID [2022-02-20 19:54:46,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {1925#false} ~q_read_ev~0 := 2; {1925#false} is VALID [2022-02-20 19:54:46,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {1925#false} assume !(~p_last_write~0 == ~c_last_read~0); {1925#false} is VALID [2022-02-20 19:54:46,424 INFO L272 TraceCheckUtils]: 43: Hoare triple {1925#false} call error1(); {1925#false} is VALID [2022-02-20 19:54:46,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-02-20 19:54:46,432 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:54:46,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:46,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522506904] [2022-02-20 19:54:46,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522506904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:46,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:46,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:46,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133359077] [2022-02-20 19:54:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:46,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:46,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:46,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:46,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:46,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:46,470 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,182 INFO L93 Difference]: Finished difference Result 531 states and 750 transitions. [2022-02-20 19:54:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2022-02-20 19:54:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2022-02-20 19:54:47,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 498 transitions. [2022-02-20 19:54:47,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,570 INFO L225 Difference]: With dead ends: 531 [2022-02-20 19:54:47,571 INFO L226 Difference]: Without dead ends: 407 [2022-02-20 19:54:47,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:47,573 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 188 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:47,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 728 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-02-20 19:54:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 350. [2022-02-20 19:54:47,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:47,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,594 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,595 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,613 INFO L93 Difference]: Finished difference Result 407 states and 574 transitions. [2022-02-20 19:54:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 574 transitions. [2022-02-20 19:54:47,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) Second operand 407 states. [2022-02-20 19:54:47,617 INFO L87 Difference]: Start difference. First operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) Second operand 407 states. [2022-02-20 19:54:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,633 INFO L93 Difference]: Finished difference Result 407 states and 574 transitions. [2022-02-20 19:54:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 574 transitions. [2022-02-20 19:54:47,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:47,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 308 states have internal predecessors, (436), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 500 transitions. [2022-02-20 19:54:47,650 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 500 transitions. Word has length 45 [2022-02-20 19:54:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:47,651 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 500 transitions. [2022-02-20 19:54:47,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 500 transitions. [2022-02-20 19:54:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:47,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:47,652 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] [2022-02-20 19:54:47,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:47,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1902298921, now seen corresponding path program 1 times [2022-02-20 19:54:47,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:47,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793229703] [2022-02-20 19:54:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#true} havoc ~__retres1~2; {3964#true} is VALID [2022-02-20 19:54:47,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3964#true} is VALID [2022-02-20 19:54:47,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} #res := ~__retres1~2; {3964#true} is VALID [2022-02-20 19:54:47,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-20 19:54:47,710 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3964#true} {3966#(= ~c_dr_pc~0 0)} #814#return; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {3986#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3964#true} is VALID [2022-02-20 19:54:47,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume 1 == ~p_dw_pc~0; {3964#true} is VALID [2022-02-20 19:54:47,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3964#true} is VALID [2022-02-20 19:54:47,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {3964#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3964#true} is VALID [2022-02-20 19:54:47,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {3964#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3964#true} is VALID [2022-02-20 19:54:47,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {3964#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3964#true} is VALID [2022-02-20 19:54:47,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {3964#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3964#true} is VALID [2022-02-20 19:54:47,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(1 == ~c_dr_pc~0); {3964#true} is VALID [2022-02-20 19:54:47,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3964#true} is VALID [2022-02-20 19:54:47,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {3964#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3964#true} is VALID [2022-02-20 19:54:47,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {3964#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3964#true} is VALID [2022-02-20 19:54:47,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3964#true} is VALID [2022-02-20 19:54:47,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-20 19:54:47,731 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3964#true} {3965#false} #818#return; {3965#false} is VALID [2022-02-20 19:54:47,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {3964#true} is VALID [2022-02-20 19:54:47,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3964#true} is VALID [2022-02-20 19:54:47,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume !false; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {3966#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume !false; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,736 INFO L272 TraceCheckUtils]: 10: Hoare triple {3966#(= ~c_dr_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {3964#true} is VALID [2022-02-20 19:54:47,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#true} havoc ~__retres1~2; {3964#true} is VALID [2022-02-20 19:54:47,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {3964#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3964#true} is VALID [2022-02-20 19:54:47,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {3964#true} #res := ~__retres1~2; {3964#true} is VALID [2022-02-20 19:54:47,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-20 19:54:47,738 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3964#true} {3966#(= ~c_dr_pc~0 0)} #814#return; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~1#1); {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~1#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; {3966#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {3966#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {3965#false} is VALID [2022-02-20 19:54:47,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {3965#false} assume 1 == ~c_dr_pc~0; {3965#false} is VALID [2022-02-20 19:54:47,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {3965#false} do_read_c_~a~0#1 := ~a_t~0; {3965#false} is VALID [2022-02-20 19:54:47,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#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_read_ev~0 := 1; {3965#false} is VALID [2022-02-20 19:54:47,754 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#false} call immediate_notify_threads(); {3986#(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:54:47,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {3986#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3964#true} is VALID [2022-02-20 19:54:47,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {3964#true} assume 1 == ~p_dw_pc~0; {3964#true} is VALID [2022-02-20 19:54:47,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {3964#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3964#true} is VALID [2022-02-20 19:54:47,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {3964#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3964#true} is VALID [2022-02-20 19:54:47,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {3964#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3964#true} is VALID [2022-02-20 19:54:47,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {3964#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3964#true} is VALID [2022-02-20 19:54:47,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {3964#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3964#true} is VALID [2022-02-20 19:54:47,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {3964#true} assume !(1 == ~c_dr_pc~0); {3964#true} is VALID [2022-02-20 19:54:47,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {3964#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3964#true} is VALID [2022-02-20 19:54:47,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {3964#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3964#true} is VALID [2022-02-20 19:54:47,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {3964#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3964#true} is VALID [2022-02-20 19:54:47,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {3964#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3964#true} is VALID [2022-02-20 19:54:47,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-20 19:54:47,757 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3964#true} {3965#false} #818#return; {3965#false} is VALID [2022-02-20 19:54:47,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#false} ~q_read_ev~0 := 2; {3965#false} is VALID [2022-02-20 19:54:47,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#false} assume !(~p_last_write~0 == ~c_last_read~0); {3965#false} is VALID [2022-02-20 19:54:47,757 INFO L272 TraceCheckUtils]: 43: Hoare triple {3965#false} call error1(); {3965#false} is VALID [2022-02-20 19:54:47,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {3965#false} assume !false; {3965#false} is VALID [2022-02-20 19:54:47,758 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:54:47,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:47,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793229703] [2022-02-20 19:54:47,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793229703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:47,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:47,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:47,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754089355] [2022-02-20 19:54:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:47,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:47,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:47,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:47,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:47,789 INFO L87 Difference]: Start difference. First operand 350 states and 500 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:48,314 INFO L93 Difference]: Finished difference Result 758 states and 1059 transitions. [2022-02-20 19:54:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:48,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2022-02-20 19:54:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2022-02-20 19:54:48,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 509 transitions. [2022-02-20 19:54:48,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:48,767 INFO L225 Difference]: With dead ends: 758 [2022-02-20 19:54:48,767 INFO L226 Difference]: Without dead ends: 567 [2022-02-20 19:54:48,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:48,769 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 413 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:48,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 582 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-02-20 19:54:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 515. [2022-02-20 19:54:48,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:48,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 567 states. Second operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,797 INFO L74 IsIncluded]: Start isIncluded. First operand 567 states. Second operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,799 INFO L87 Difference]: Start difference. First operand 567 states. Second operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:48,823 INFO L93 Difference]: Finished difference Result 567 states and 781 transitions. [2022-02-20 19:54:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 781 transitions. [2022-02-20 19:54:48,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:48,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:48,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) Second operand 567 states. [2022-02-20 19:54:48,828 INFO L87 Difference]: Start difference. First operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) Second operand 567 states. [2022-02-20 19:54:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:48,851 INFO L93 Difference]: Finished difference Result 567 states and 781 transitions. [2022-02-20 19:54:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 781 transitions. [2022-02-20 19:54:48,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:48,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:48,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:48,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.3911111111111112) internal successors, (626), 457 states have internal predecessors, (626), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 718 transitions. [2022-02-20 19:54:48,880 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 718 transitions. Word has length 45 [2022-02-20 19:54:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:48,880 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 718 transitions. [2022-02-20 19:54:48,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 718 transitions. [2022-02-20 19:54:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 19:54:48,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:48,882 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:48,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:48,883 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1972716290, now seen corresponding path program 1 times [2022-02-20 19:54:48,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:48,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917820136] [2022-02-20 19:54:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:48,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#true} havoc ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6859#true} is VALID [2022-02-20 19:54:48,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {6859#true} #res := ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,944 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6859#true} {6859#true} #814#return; {6859#true} is VALID [2022-02-20 19:54:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:54:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:48,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#true} havoc ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6859#true} is VALID [2022-02-20 19:54:48,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {6859#true} #res := ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,950 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6859#true} {6866#(= ~c_dr_st~0 2)} #814#return; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:48,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {6886#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#true} assume 1 == ~p_dw_pc~0; {6859#true} is VALID [2022-02-20 19:54:48,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {6859#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6859#true} is VALID [2022-02-20 19:54:48,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {6859#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {6859#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6859#true} is VALID [2022-02-20 19:54:48,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {6859#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {6859#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6859#true} is VALID [2022-02-20 19:54:48,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {6859#true} assume !(1 == ~c_dr_pc~0); {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {6859#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {6859#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {6859#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {6859#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,964 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6859#true} {6860#false} #818#return; {6860#false} is VALID [2022-02-20 19:54:48,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {6859#true} is VALID [2022-02-20 19:54:48,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {6859#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {6859#true} is VALID [2022-02-20 19:54:48,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {6859#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {6859#true} is VALID [2022-02-20 19:54:48,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {6859#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {6859#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {6859#true} assume { :end_inline_init_threads1 } true; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {6859#true} assume !false; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {6859#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {6859#true} assume !false; {6859#true} is VALID [2022-02-20 19:54:48,966 INFO L272 TraceCheckUtils]: 10: Hoare triple {6859#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {6859#true} havoc ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {6859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {6859#true} #res := ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6859#true} {6859#true} #814#return; {6859#true} is VALID [2022-02-20 19:54:48,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {6859#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6859#true} is VALID [2022-02-20 19:54:48,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {6859#true} assume 0 != eval1_~tmp___1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {6859#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6859#true} is VALID [2022-02-20 19:54:48,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {6859#true} assume !(0 != eval1_~tmp~1#1); {6859#true} is VALID [2022-02-20 19:54:48,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {6859#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6859#true} is VALID [2022-02-20 19:54:48,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {6859#true} assume 0 != eval1_~tmp___0~1#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; {6859#true} is VALID [2022-02-20 19:54:48,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {6859#true} assume 0 == ~c_dr_pc~0; {6859#true} is VALID [2022-02-20 19:54:48,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {6859#true} assume !false; {6859#true} is VALID [2022-02-20 19:54:48,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {6859#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {6866#(= ~c_dr_st~0 2)} assume { :end_inline_do_read_c } true; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {6866#(= ~c_dr_st~0 2)} assume !false; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,970 INFO L272 TraceCheckUtils]: 27: Hoare triple {6866#(= ~c_dr_st~0 2)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6859#true} is VALID [2022-02-20 19:54:48,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {6859#true} havoc ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {6859#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6859#true} is VALID [2022-02-20 19:54:48,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {6859#true} #res := ~__retres1~2; {6859#true} is VALID [2022-02-20 19:54:48,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,971 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6859#true} {6866#(= ~c_dr_st~0 2)} #814#return; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {6866#(= ~c_dr_st~0 2)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {6866#(= ~c_dr_st~0 2)} assume 0 != eval1_~tmp___1~0#1; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {6866#(= ~c_dr_st~0 2)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {6866#(= ~c_dr_st~0 2)} assume !(0 != eval1_~tmp~1#1); {6866#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:48,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {6866#(= ~c_dr_st~0 2)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {6860#false} assume 0 != eval1_~tmp___0~1#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; {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {6860#false} assume !(0 == ~c_dr_pc~0); {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {6860#false} assume 1 == ~c_dr_pc~0; {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {6860#false} do_read_c_~a~0#1 := ~a_t~0; {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {6860#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_read_ev~0 := 1; {6860#false} is VALID [2022-02-20 19:54:48,974 INFO L272 TraceCheckUtils]: 43: Hoare triple {6860#false} call immediate_notify_threads(); {6886#(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:54:48,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {6886#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {6859#true} assume 1 == ~p_dw_pc~0; {6859#true} is VALID [2022-02-20 19:54:48,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {6859#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6859#true} is VALID [2022-02-20 19:54:48,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {6859#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6859#true} is VALID [2022-02-20 19:54:48,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {6859#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6859#true} is VALID [2022-02-20 19:54:48,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {6859#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {6859#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {6859#true} assume !(1 == ~c_dr_pc~0); {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {6859#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {6859#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {6859#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6859#true} is VALID [2022-02-20 19:54:48,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {6859#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6859#true} is VALID [2022-02-20 19:54:48,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {6859#true} assume true; {6859#true} is VALID [2022-02-20 19:54:48,977 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6859#true} {6860#false} #818#return; {6860#false} is VALID [2022-02-20 19:54:48,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {6860#false} ~q_read_ev~0 := 2; {6860#false} is VALID [2022-02-20 19:54:48,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {6860#false} assume !(~p_last_write~0 == ~c_last_read~0); {6860#false} is VALID [2022-02-20 19:54:48,977 INFO L272 TraceCheckUtils]: 60: Hoare triple {6860#false} call error1(); {6860#false} is VALID [2022-02-20 19:54:48,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {6860#false} assume !false; {6860#false} is VALID [2022-02-20 19:54:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:54:48,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:48,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917820136] [2022-02-20 19:54:48,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917820136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:48,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:48,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:48,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379312448] [2022-02-20 19:54:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:48,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:48,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:49,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:49,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:49,015 INFO L87 Difference]: Start difference. First operand 515 states and 718 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,785 INFO L93 Difference]: Finished difference Result 1099 states and 1503 transitions. [2022-02-20 19:54:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:49,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-02-20 19:54:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-02-20 19:54:49,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-02-20 19:54:50,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,204 INFO L225 Difference]: With dead ends: 1099 [2022-02-20 19:54:50,205 INFO L226 Difference]: Without dead ends: 743 [2022-02-20 19:54:50,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:50,215 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 172 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:50,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 783 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-02-20 19:54:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2022-02-20 19:54:50,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:50,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,251 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,252 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,289 INFO L93 Difference]: Finished difference Result 743 states and 1002 transitions. [2022-02-20 19:54:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1002 transitions. [2022-02-20 19:54:50,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) Second operand 743 states. [2022-02-20 19:54:50,294 INFO L87 Difference]: Start difference. First operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) Second operand 743 states. [2022-02-20 19:54:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,328 INFO L93 Difference]: Finished difference Result 743 states and 1002 transitions. [2022-02-20 19:54:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1002 transitions. [2022-02-20 19:54:50,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:50,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 625 states have internal predecessors, (826), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 956 transitions. [2022-02-20 19:54:50,365 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 956 transitions. Word has length 62 [2022-02-20 19:54:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:50,365 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 956 transitions. [2022-02-20 19:54:50,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 956 transitions. [2022-02-20 19:54:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:54:50,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:50,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:50,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:50,367 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -785609067, now seen corresponding path program 1 times [2022-02-20 19:54:50,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:50,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968107408] [2022-02-20 19:54:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {10857#true} havoc ~__retres1~2; {10857#true} is VALID [2022-02-20 19:54:50,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10857#true} is VALID [2022-02-20 19:54:50,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} #res := ~__retres1~2; {10857#true} is VALID [2022-02-20 19:54:50,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,411 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10857#true} {10859#(= ~p_dw_pc~0 0)} #814#return; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 19:54:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 1 == ~p_dw_pc~0; {10857#true} is VALID [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10857#true} is VALID [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {10857#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {10857#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10857#true} is VALID [2022-02-20 19:54:50,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {10857#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {10857#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {10857#true} assume !(1 == ~c_dr_pc~0); {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {10857#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {10857#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10857#true} is VALID [2022-02-20 19:54:50,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {10857#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,425 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10857#true} {10858#false} #816#return; {10858#false} is VALID [2022-02-20 19:54:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:54:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume 1 == ~p_dw_pc~0; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {10857#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {10857#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {10857#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {10857#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {10857#true} assume !(1 == ~c_dr_pc~0); {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {10857#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {10857#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {10857#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {10857#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,434 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10857#true} {10858#false} #818#return; {10858#false} is VALID [2022-02-20 19:54:50,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {10857#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {10857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {10857#true} is VALID [2022-02-20 19:54:50,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {10857#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume !false; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {10859#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume !false; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,438 INFO L272 TraceCheckUtils]: 10: Hoare triple {10859#(= ~p_dw_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {10857#true} is VALID [2022-02-20 19:54:50,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {10857#true} havoc ~__retres1~2; {10857#true} is VALID [2022-02-20 19:54:50,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {10857#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10857#true} is VALID [2022-02-20 19:54:50,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {10857#true} #res := ~__retres1~2; {10857#true} is VALID [2022-02-20 19:54:50,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10857#true} {10859#(= ~p_dw_pc~0 0)} #814#return; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {10859#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {10859#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {10858#false} is VALID [2022-02-20 19:54:50,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {10858#false} assume 1 == ~p_dw_pc~0; {10858#false} is VALID [2022-02-20 19:54:50,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {10858#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {10858#false} is VALID [2022-02-20 19:54:50,441 INFO L272 TraceCheckUtils]: 23: Hoare triple {10858#false} call immediate_notify_threads(); {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {10857#true} assume 1 == ~p_dw_pc~0; {10857#true} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {10857#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10857#true} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {10857#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {10857#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10857#true} is VALID [2022-02-20 19:54:50,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {10857#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {10857#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {10857#true} assume !(1 == ~c_dr_pc~0); {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {10857#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {10857#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {10857#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10857#true} is VALID [2022-02-20 19:54:50,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {10857#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,444 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10857#true} {10858#false} #816#return; {10858#false} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {10858#false} ~q_write_ev~0 := 2; {10858#false} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {10858#false} assume !false; {10858#false} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {10858#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {10858#false} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {10858#false} assume { :end_inline_do_write_p } true; {10858#false} is VALID [2022-02-20 19:54:50,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {10858#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {10858#false} assume 0 != eval1_~tmp___0~1#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; {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {10858#false} assume 0 == ~c_dr_pc~0; {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {10858#false} assume !false; {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {10858#false} assume !(1 == ~q_free~0); {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {10858#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_read_ev~0 := 1; {10858#false} is VALID [2022-02-20 19:54:50,445 INFO L272 TraceCheckUtils]: 48: Hoare triple {10858#false} call immediate_notify_threads(); {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {10893#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {10857#true} assume 1 == ~p_dw_pc~0; {10857#true} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {10857#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10857#true} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {10857#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10857#true} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {10857#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10857#true} is VALID [2022-02-20 19:54:50,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {10857#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {10857#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {10857#true} assume !(1 == ~c_dr_pc~0); {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {10857#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {10857#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {10857#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10857#true} is VALID [2022-02-20 19:54:50,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {10857#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10857#true} is VALID [2022-02-20 19:54:50,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {10857#true} assume true; {10857#true} is VALID [2022-02-20 19:54:50,448 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10857#true} {10858#false} #818#return; {10858#false} is VALID [2022-02-20 19:54:50,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {10858#false} ~q_read_ev~0 := 2; {10858#false} is VALID [2022-02-20 19:54:50,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {10858#false} assume !(~p_last_write~0 == ~c_last_read~0); {10858#false} is VALID [2022-02-20 19:54:50,448 INFO L272 TraceCheckUtils]: 65: Hoare triple {10858#false} call error1(); {10858#false} is VALID [2022-02-20 19:54:50,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {10858#false} assume !false; {10858#false} is VALID [2022-02-20 19:54:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 19:54:50,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:50,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968107408] [2022-02-20 19:54:50,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968107408] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:50,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:50,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:50,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534291497] [2022-02-20 19:54:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:50,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:50,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:50,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:50,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:50,484 INFO L87 Difference]: Start difference. First operand 705 states and 956 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,152 INFO L93 Difference]: Finished difference Result 1358 states and 1809 transitions. [2022-02-20 19:54:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:51,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-20 19:54:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-20 19:54:51,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-02-20 19:54:51,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:51,570 INFO L225 Difference]: With dead ends: 1358 [2022-02-20 19:54:51,570 INFO L226 Difference]: Without dead ends: 904 [2022-02-20 19:54:51,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:51,572 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 400 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:51,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 579 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-02-20 19:54:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 849. [2022-02-20 19:54:51,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:51,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 904 states. Second operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,613 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,615 INFO L87 Difference]: Start difference. First operand 904 states. Second operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,667 INFO L93 Difference]: Finished difference Result 904 states and 1196 transitions. [2022-02-20 19:54:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1196 transitions. [2022-02-20 19:54:51,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 904 states. [2022-02-20 19:54:51,672 INFO L87 Difference]: Start difference. First operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 904 states. [2022-02-20 19:54:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,724 INFO L93 Difference]: Finished difference Result 904 states and 1196 transitions. [2022-02-20 19:54:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1196 transitions. [2022-02-20 19:54:51,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:51,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 744 states have (on average 1.3131720430107527) internal successors, (977), 755 states have internal predecessors, (977), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1129 transitions. [2022-02-20 19:54:51,785 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1129 transitions. Word has length 67 [2022-02-20 19:54:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:51,786 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1129 transitions. [2022-02-20 19:54:51,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1129 transitions. [2022-02-20 19:54:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:51,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:51,788 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:51,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:51,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1619896469, now seen corresponding path program 1 times [2022-02-20 19:54:51,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:51,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382561097] [2022-02-20 19:54:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {15752#true} havoc ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:51,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15752#true} is VALID [2022-02-20 19:54:51,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} #res := ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:51,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:51,827 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15752#true} {15752#true} #814#return; {15752#true} is VALID [2022-02-20 19:54:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:54:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {15787#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume !(1 == ~p_dw_pc~0); {15752#true} is VALID [2022-02-20 19:54:51,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15788#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:51,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {15788#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15789#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:51,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {15789#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15790#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:51,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {15790#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15753#false} is VALID [2022-02-20 19:54:51,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {15753#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15753#false} is VALID [2022-02-20 19:54:51,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#false} assume !(1 == ~c_dr_pc~0); {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {15753#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#false} assume true; {15753#false} is VALID [2022-02-20 19:54:51,884 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#false} {15752#true} #816#return; {15753#false} is VALID [2022-02-20 19:54:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:54:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {15787#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume 1 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:51,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {15752#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {15752#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {15752#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {15752#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {15752#true} assume !(1 == ~c_dr_pc~0); {15752#true} is VALID [2022-02-20 19:54:51,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {15752#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15752#true} is VALID [2022-02-20 19:54:51,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {15752#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:51,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {15752#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15752#true} is VALID [2022-02-20 19:54:51,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {15752#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:51,893 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15752#true} {15753#false} #818#return; {15753#false} is VALID [2022-02-20 19:54:51,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {15752#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {15752#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {15752#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {15752#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {15752#true} assume { :end_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:51,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {15752#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L272 TraceCheckUtils]: 10: Hoare triple {15752#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {15752#true} havoc ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {15752#true} #res := ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:51,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15752#true} {15752#true} #814#return; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {15752#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {15752#true} assume 0 != eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {15752#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {15752#true} assume 0 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:51,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:51,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {15752#true} assume !(0 == ~q_free~0); {15752#true} is VALID [2022-02-20 19:54:51,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {15752#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {15752#true} is VALID [2022-02-20 19:54:51,897 INFO L272 TraceCheckUtils]: 24: Hoare triple {15752#true} call immediate_notify_threads(); {15787#(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:54:51,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {15787#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {15752#true} assume !(1 == ~p_dw_pc~0); {15752#true} is VALID [2022-02-20 19:54:51,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {15752#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15788#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:51,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {15788#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15789#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:51,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {15789#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15790#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {15790#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {15753#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {15753#false} assume !(1 == ~c_dr_pc~0); {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {15753#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {15753#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {15753#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15753#false} is VALID [2022-02-20 19:54:51,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {15753#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {15753#false} assume true; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15753#false} {15752#true} #816#return; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {15753#false} ~q_write_ev~0 := 2; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {15753#false} assume !false; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {15753#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {15753#false} assume { :end_inline_do_write_p } true; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {15753#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {15753#false} is VALID [2022-02-20 19:54:51,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {15753#false} assume 0 != eval1_~tmp___0~1#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; {15753#false} is VALID [2022-02-20 19:54:51,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {15753#false} assume 0 == ~c_dr_pc~0; {15753#false} is VALID [2022-02-20 19:54:51,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {15753#false} assume !false; {15753#false} is VALID [2022-02-20 19:54:51,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {15753#false} assume !(1 == ~q_free~0); {15753#false} is VALID [2022-02-20 19:54:51,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {15753#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_read_ev~0 := 1; {15753#false} is VALID [2022-02-20 19:54:51,902 INFO L272 TraceCheckUtils]: 49: Hoare triple {15753#false} call immediate_notify_threads(); {15787#(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:54:51,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {15787#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {15752#true} assume 1 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {15752#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {15752#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {15752#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {15752#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {15752#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {15752#true} assume !(1 == ~c_dr_pc~0); {15752#true} is VALID [2022-02-20 19:54:51,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {15752#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15752#true} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {15752#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {15752#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15752#true} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {15752#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:51,904 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15752#true} {15753#false} #818#return; {15753#false} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {15753#false} ~q_read_ev~0 := 2; {15753#false} is VALID [2022-02-20 19:54:51,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {15753#false} assume !(~p_last_write~0 == ~c_last_read~0); {15753#false} is VALID [2022-02-20 19:54:51,905 INFO L272 TraceCheckUtils]: 66: Hoare triple {15753#false} call error1(); {15753#false} is VALID [2022-02-20 19:54:51,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {15753#false} assume !false; {15753#false} is VALID [2022-02-20 19:54:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:54:51,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:51,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382561097] [2022-02-20 19:54:51,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382561097] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:51,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464651701] [2022-02-20 19:54:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:51,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:54:51,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:54:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:54:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:54:52,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {15752#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {15752#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {15752#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {15752#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {15752#true} assume { :end_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {15752#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L272 TraceCheckUtils]: 10: Hoare triple {15752#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {15752#true} havoc ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {15752#true} #res := ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15752#true} {15752#true} #814#return; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {15752#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {15752#true} assume 0 != eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15752#true} is VALID [2022-02-20 19:54:52,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {15752#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15752#true} is VALID [2022-02-20 19:54:52,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {15752#true} assume 0 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:52,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {15752#true} assume !(0 == ~q_free~0); {15752#true} is VALID [2022-02-20 19:54:52,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {15752#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,357 INFO L272 TraceCheckUtils]: 24: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~p_dw_pc~0); {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_~__retres1~0#1 := 0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~c_dr_pc~0); {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume true; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,363 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15863#(= ~p_last_write~0 ~q_buf_0~0)} {15863#(= ~p_last_write~0 ~q_buf_0~0)} #816#return; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,379 INFO L272 TraceCheckUtils]: 49: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~p_dw_pc~0; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume !(1 == ~c_dr_pc~0); {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume true; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,384 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15939#(= ~c_last_read~0 ~p_last_write~0)} {15939#(= ~c_last_read~0 ~p_last_write~0)} #818#return; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {15753#false} is VALID [2022-02-20 19:54:52,385 INFO L272 TraceCheckUtils]: 66: Hoare triple {15753#false} call error1(); {15753#false} is VALID [2022-02-20 19:54:52,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {15753#false} assume !false; {15753#false} is VALID [2022-02-20 19:54:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:52,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:54:52,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {15753#false} assume !false; {15753#false} is VALID [2022-02-20 19:54:52,605 INFO L272 TraceCheckUtils]: 66: Hoare triple {15753#false} call error1(); {15753#false} is VALID [2022-02-20 19:54:52,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {15753#false} is VALID [2022-02-20 19:54:52,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,607 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15752#true} {15939#(= ~c_last_read~0 ~p_last_write~0)} #818#return; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:52,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {15752#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {15752#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {15752#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {15752#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {15752#true} assume !(1 == ~c_dr_pc~0); {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {15752#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {15752#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {15752#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15752#true} is VALID [2022-02-20 19:54:52,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {15752#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {15752#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15752#true} is VALID [2022-02-20 19:54:52,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {15752#true} assume 1 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:52,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {15752#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,609 INFO L272 TraceCheckUtils]: 49: Hoare triple {15939#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {15752#true} is VALID [2022-02-20 19:54:52,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {15939#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,614 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15752#true} {15863#(= ~p_last_write~0 ~q_buf_0~0)} #816#return; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {15752#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {15752#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {15752#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {15752#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {15752#true} assume !(1 == ~c_dr_pc~0); {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {15752#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15752#true} is VALID [2022-02-20 19:54:52,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {15752#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {15752#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {15752#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {15752#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {15752#true} assume !(1 == ~p_dw_pc~0); {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {15752#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,616 INFO L272 TraceCheckUtils]: 24: Hoare triple {15863#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {15752#true} is VALID [2022-02-20 19:54:52,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {15752#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {15863#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {15752#true} assume !(0 == ~q_free~0); {15752#true} is VALID [2022-02-20 19:54:52,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {15752#true} assume 0 == ~p_dw_pc~0; {15752#true} is VALID [2022-02-20 19:54:52,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {15752#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {15752#true} assume 0 != eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {15752#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15752#true} {15752#true} #814#return; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {15752#true} assume true; {15752#true} is VALID [2022-02-20 19:54:52,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {15752#true} #res := ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {15752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {15752#true} havoc ~__retres1~2; {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L272 TraceCheckUtils]: 10: Hoare triple {15752#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {15752#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15752#true} is VALID [2022-02-20 19:54:52,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {15752#true} assume !false; {15752#true} is VALID [2022-02-20 19:54:52,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {15752#true} assume { :end_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:52,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {15752#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {15752#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {15752#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15752#true} is VALID [2022-02-20 19:54:52,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {15752#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {15752#true} is VALID [2022-02-20 19:54:52,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {15752#true} is VALID [2022-02-20 19:54:52,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {15752#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {15752#true} is VALID [2022-02-20 19:54:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:54:52,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464651701] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:52,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:54:52,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-02-20 19:54:52,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732145509] [2022-02-20 19:54:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:54:52,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:52,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:52,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:52,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:52,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:52,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:52,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:54:52,686 INFO L87 Difference]: Start difference. First operand 849 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,238 INFO L93 Difference]: Finished difference Result 905 states and 1197 transitions. [2022-02-20 19:54:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:54:53,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:54:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2022-02-20 19:54:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2022-02-20 19:54:53,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 384 transitions. [2022-02-20 19:54:53,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:53,591 INFO L225 Difference]: With dead ends: 905 [2022-02-20 19:54:53,591 INFO L226 Difference]: Without dead ends: 902 [2022-02-20 19:54:53,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:54:53,593 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 557 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:53,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 411 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-02-20 19:54:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 848. [2022-02-20 19:54:53,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:53,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 902 states. Second operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,645 INFO L74 IsIncluded]: Start isIncluded. First operand 902 states. Second operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,646 INFO L87 Difference]: Start difference. First operand 902 states. Second operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,694 INFO L93 Difference]: Finished difference Result 902 states and 1193 transitions. [2022-02-20 19:54:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1193 transitions. [2022-02-20 19:54:53,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 902 states. [2022-02-20 19:54:53,699 INFO L87 Difference]: Start difference. First operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 902 states. [2022-02-20 19:54:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,747 INFO L93 Difference]: Finished difference Result 902 states and 1193 transitions. [2022-02-20 19:54:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1193 transitions. [2022-02-20 19:54:53,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:53,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 744 states have (on average 1.310483870967742) internal successors, (975), 754 states have internal predecessors, (975), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1126 transitions. [2022-02-20 19:54:53,806 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1126 transitions. Word has length 68 [2022-02-20 19:54:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:53,806 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 1126 transitions. [2022-02-20 19:54:53,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1126 transitions. [2022-02-20 19:54:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:54:53,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:53,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:53,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:54:54,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 19:54:54,024 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1323549800, now seen corresponding path program 1 times [2022-02-20 19:54:54,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:54,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913288883] [2022-02-20 19:54:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {20435#true} havoc ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20435#true} is VALID [2022-02-20 19:54:54,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} #res := ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,069 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20435#true} {20435#true} #814#return; {20435#true} is VALID [2022-02-20 19:54:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:54:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {20470#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume !(1 == ~p_dw_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20471#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:54,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {20471#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20472#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:54,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {20472#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20473#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:54,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {20473#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20436#false} is VALID [2022-02-20 19:54:54,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {20436#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {20436#false} assume !(1 == ~c_dr_pc~0); {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {20436#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {20436#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {20436#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {20436#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {20436#false} assume true; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20436#false} {20435#true} #816#return; {20436#false} is VALID [2022-02-20 19:54:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:54:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {20470#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume 1 == ~p_dw_pc~0; {20435#true} is VALID [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20435#true} is VALID [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {20435#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {20435#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20435#true} is VALID [2022-02-20 19:54:54,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {20435#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {20435#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {20435#true} assume !(1 == ~c_dr_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {20435#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {20435#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {20435#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {20435#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,143 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20435#true} {20436#false} #818#return; {20436#false} is VALID [2022-02-20 19:54:54,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {20435#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {20435#true} is VALID [2022-02-20 19:54:54,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {20435#true} is VALID [2022-02-20 19:54:54,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {20435#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20435#true} is VALID [2022-02-20 19:54:54,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {20435#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {20435#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {20435#true} assume { :end_inline_init_threads1 } true; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {20435#true} assume !false; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {20435#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {20435#true} assume !false; {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L272 TraceCheckUtils]: 10: Hoare triple {20435#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20435#true} is VALID [2022-02-20 19:54:54,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {20435#true} havoc ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {20435#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {20435#true} #res := ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20435#true} {20435#true} #814#return; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {20435#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {20435#true} assume 0 != eval1_~tmp___1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {20435#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20435#true} is VALID [2022-02-20 19:54:54,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {20435#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20435#true} is VALID [2022-02-20 19:54:54,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {20435#true} assume 0 == ~p_dw_pc~0; {20435#true} is VALID [2022-02-20 19:54:54,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {20435#true} assume !false; {20435#true} is VALID [2022-02-20 19:54:54,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {20435#true} assume !(0 == ~q_free~0); {20435#true} is VALID [2022-02-20 19:54:54,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {20435#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20435#true} is VALID [2022-02-20 19:54:54,147 INFO L272 TraceCheckUtils]: 24: Hoare triple {20435#true} call immediate_notify_threads(); {20470#(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:54:54,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {20470#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {20435#true} assume !(1 == ~p_dw_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {20435#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20471#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:54,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {20471#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20472#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:54,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {20472#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20473#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {20473#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20436#false} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {20436#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20436#false} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {20436#false} assume !(1 == ~c_dr_pc~0); {20436#false} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {20436#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {20436#false} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {20436#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20436#false} is VALID [2022-02-20 19:54:54,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {20436#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {20436#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {20436#false} assume true; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20436#false} {20435#true} #816#return; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {20436#false} ~q_write_ev~0 := 2; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {20436#false} assume !false; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {20436#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20436#false} is VALID [2022-02-20 19:54:54,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {20436#false} assume { :end_inline_do_write_p } true; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {20436#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {20436#false} assume 0 != eval1_~tmp___0~1#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; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {20436#false} assume 0 == ~c_dr_pc~0; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {20436#false} assume !false; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {20436#false} assume !(1 == ~q_free~0); {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {20436#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_read_ev~0 := 1; {20436#false} is VALID [2022-02-20 19:54:54,151 INFO L272 TraceCheckUtils]: 49: Hoare triple {20436#false} call immediate_notify_threads(); {20470#(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:54:54,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {20470#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {20435#true} assume 1 == ~p_dw_pc~0; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {20435#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {20435#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {20435#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {20435#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {20435#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {20435#true} assume !(1 == ~c_dr_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {20435#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {20435#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {20435#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {20435#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,153 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20435#true} {20436#false} #818#return; {20436#false} is VALID [2022-02-20 19:54:54,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {20436#false} ~q_read_ev~0 := 2; {20436#false} is VALID [2022-02-20 19:54:54,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {20436#false} assume ~p_last_write~0 == ~c_last_read~0; {20436#false} is VALID [2022-02-20 19:54:54,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {20436#false} assume !(~p_num_write~0 == ~c_num_read~0); {20436#false} is VALID [2022-02-20 19:54:54,154 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#false} call error1(); {20436#false} is VALID [2022-02-20 19:54:54,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#false} assume !false; {20436#false} is VALID [2022-02-20 19:54:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:54:54,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:54,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913288883] [2022-02-20 19:54:54,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913288883] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:54,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669037882] [2022-02-20 19:54:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:54,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:54,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:54:54,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:54:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:54:54,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {20435#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {20435#true} is VALID [2022-02-20 19:54:54,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,700 INFO L272 TraceCheckUtils]: 10: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,702 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #814#return; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {20483#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,706 INFO L272 TraceCheckUtils]: 24: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~p_dw_pc~0); {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_~__retres1~0#1 := 0; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume true; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,712 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #816#return; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} ~q_write_ev~0 := 2; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :end_inline_do_write_p } true; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != eval1_~tmp___0~1#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; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_pc~0; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~q_free~0); {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {20547#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,716 INFO L272 TraceCheckUtils]: 49: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~p_dw_pc~0; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume true; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,722 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #818#return; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} ~q_read_ev~0 := 2; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume ~p_last_write~0 == ~c_last_read~0; {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {20623#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(~p_num_write~0 == ~c_num_read~0); {20436#false} is VALID [2022-02-20 19:54:54,724 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#false} call error1(); {20436#false} is VALID [2022-02-20 19:54:54,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#false} assume !false; {20436#false} is VALID [2022-02-20 19:54:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:54,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:54:54,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#false} assume !false; {20436#false} is VALID [2022-02-20 19:54:54,924 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#false} call error1(); {20436#false} is VALID [2022-02-20 19:54:54,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume !(~p_num_write~0 == ~c_num_read~0); {20436#false} is VALID [2022-02-20 19:54:54,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume ~p_last_write~0 == ~c_last_read~0; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} ~q_read_ev~0 := 2; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,925 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20435#true} {20690#(= ~c_num_read~0 ~p_num_write~0)} #818#return; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {20435#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {20435#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {20435#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {20435#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {20435#true} assume !(1 == ~c_dr_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {20435#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {20435#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {20435#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {20435#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {20435#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {20435#true} assume 1 == ~p_dw_pc~0; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {20435#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,927 INFO L272 TraceCheckUtils]: 49: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} call immediate_notify_threads(); {20435#true} is VALID [2022-02-20 19:54:54,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !(1 == ~q_free~0); {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_pc~0; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 != eval1_~tmp___0~1#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; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume { :end_inline_do_write_p } true; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} ~q_write_ev~0 := 2; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,932 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20435#true} {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} #816#return; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {20435#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {20435#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20435#true} is VALID [2022-02-20 19:54:54,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {20435#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {20435#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {20435#true} assume !(1 == ~c_dr_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {20435#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {20435#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {20435#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {20435#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {20435#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20435#true} is VALID [2022-02-20 19:54:54,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {20435#true} assume !(1 == ~p_dw_pc~0); {20435#true} is VALID [2022-02-20 19:54:54,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {20435#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20435#true} is VALID [2022-02-20 19:54:54,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} call immediate_notify_threads(); {20435#true} is VALID [2022-02-20 19:54:54,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20745#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:54,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume !(0 == ~q_free~0); {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_pc~0; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp___1~0#1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,938 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20435#true} {20690#(= ~c_num_read~0 ~p_num_write~0)} #814#return; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {20435#true} assume true; {20435#true} is VALID [2022-02-20 19:54:54,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {20435#true} #res := ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {20435#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20435#true} is VALID [2022-02-20 19:54:54,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {20435#true} havoc ~__retres1~2; {20435#true} is VALID [2022-02-20 19:54:54,938 INFO L272 TraceCheckUtils]: 10: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20435#true} is VALID [2022-02-20 19:54:54,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_threads1 } true; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {20690#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {20435#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {20690#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:54,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {20435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {20435#true} is VALID [2022-02-20 19:54:54,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {20435#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {20435#true} is VALID [2022-02-20 19:54:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:54:54,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669037882] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:54:54,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:54:54,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-02-20 19:54:54,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922367517] [2022-02-20 19:54:54,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:54:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:54:54,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:54,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:55,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:55,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 19:54:55,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 19:54:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:54:55,076 INFO L87 Difference]: Start difference. First operand 848 states and 1126 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:59,154 INFO L93 Difference]: Finished difference Result 2548 states and 3346 transitions. [2022-02-20 19:54:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-20 19:54:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:54:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 857 transitions. [2022-02-20 19:54:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 857 transitions. [2022-02-20 19:54:59,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 857 transitions. [2022-02-20 19:54:59,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 857 edges. 857 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:59,972 INFO L225 Difference]: With dead ends: 2548 [2022-02-20 19:54:59,972 INFO L226 Difference]: Without dead ends: 2004 [2022-02-20 19:54:59,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 19:54:59,974 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1014 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:59,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 2284 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:54:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-02-20 19:55:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1237. [2022-02-20 19:55:00,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:00,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2004 states. Second operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:00,194 INFO L74 IsIncluded]: Start isIncluded. First operand 2004 states. Second operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:00,196 INFO L87 Difference]: Start difference. First operand 2004 states. Second operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,393 INFO L93 Difference]: Finished difference Result 2004 states and 2572 transitions. [2022-02-20 19:55:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2572 transitions. [2022-02-20 19:55:00,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) Second operand 2004 states. [2022-02-20 19:55:00,402 INFO L87 Difference]: Start difference. First operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) Second operand 2004 states. [2022-02-20 19:55:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,608 INFO L93 Difference]: Finished difference Result 2004 states and 2572 transitions. [2022-02-20 19:55:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2572 transitions. [2022-02-20 19:55:00,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:00,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1094 states have (on average 1.2879341864716636) internal successors, (1409), 1112 states have internal predecessors, (1409), 82 states have call successors, (82), 49 states have call predecessors, (82), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1614 transitions. [2022-02-20 19:55:00,725 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1614 transitions. Word has length 69 [2022-02-20 19:55:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:00,725 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1614 transitions. [2022-02-20 19:55:00,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1614 transitions. [2022-02-20 19:55:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:00,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:00,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:00,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:55:00,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 19:55:00,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -931355791, now seen corresponding path program 1 times [2022-02-20 19:55:00,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:00,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103581499] [2022-02-20 19:55:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,001 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {30190#true} {30192#(= ~M_E~0 2)} #826#return; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume true; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,031 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {30247#(= |old(~M_E~0)| 0)} {30192#(= ~M_E~0 2)} #828#return; {30191#false} is VALID [2022-02-20 19:55:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {30248#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {30190#true} assume 1 == ~m_pc~0; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {30190#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {30190#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {30190#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {30190#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {30190#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; {30190#true} is VALID [2022-02-20 19:55:01,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {30190#true} assume !(1 == ~t1_pc~0); {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {30190#true} is_transmit1_triggered_~__retres1~5#1 := 0; {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {30190#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {30190#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {30190#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {30190#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; {30190#true} is VALID [2022-02-20 19:55:01,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#true} assume 1 == ~t2_pc~0; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#true} assume !(1 == ~t3_pc~0); {30190#true} is VALID [2022-02-20 19:55:01,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#true} is_transmit3_triggered_~__retres1~7#1 := 0; {30190#true} is VALID [2022-02-20 19:55:01,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {30190#true} is VALID [2022-02-20 19:55:01,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {30190#true} is VALID [2022-02-20 19:55:01,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,051 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30190#true} {30191#false} #830#return; {30191#false} is VALID [2022-02-20 19:55:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {30190#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {30190#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {30190#true} assume !(1 == ~T3_E~0); {30190#true} is VALID [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {30190#true} assume 1 == ~E_M~0;~E_M~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {30190#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {30190#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {30190#true} assume 1 == ~E_3~0;~E_3~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,058 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {30190#true} {30191#false} #832#return; {30191#false} is VALID [2022-02-20 19:55:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {30190#true} havoc ~__retres1~8; {30190#true} is VALID [2022-02-20 19:55:01,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {30190#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {30190#true} is VALID [2022-02-20 19:55:01,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {30190#true} #res := ~__retres1~8; {30190#true} is VALID [2022-02-20 19:55:01,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,062 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30190#true} {30191#false} #834#return; {30191#false} is VALID [2022-02-20 19:55:01,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {30190#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {30192#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {30192#(= ~M_E~0 2)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {30192#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {30192#(= ~M_E~0 2)} call update_channels2(); {30190#true} is VALID [2022-02-20 19:55:01,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,065 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30190#true} {30192#(= ~M_E~0 2)} #826#return; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {30192#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {30192#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {30192#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {30192#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {30192#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {30192#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {30192#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,075 INFO L272 TraceCheckUtils]: 13: Hoare triple {30192#(= ~M_E~0 2)} call fire_delta_events2(); {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:01,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {30247#(= |old(~M_E~0)| 0)} assume true; {30247#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30247#(= |old(~M_E~0)| 0)} {30192#(= ~M_E~0 2)} #828#return; {30191#false} is VALID [2022-02-20 19:55:01,078 INFO L272 TraceCheckUtils]: 24: Hoare triple {30191#false} call activate_threads2(); {30248#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {30248#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {30190#true} assume 1 == ~m_pc~0; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {30190#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {30190#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {30190#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {30190#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {30190#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; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {30190#true} assume !(1 == ~t1_pc~0); {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {30190#true} is_transmit1_triggered_~__retres1~5#1 := 0; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {30190#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {30190#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {30190#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {30190#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; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {30190#true} assume 1 == ~t2_pc~0; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {30190#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {30190#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30190#true} is VALID [2022-02-20 19:55:01,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {30190#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {30190#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {30190#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {30190#true} assume !(1 == ~t3_pc~0); {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {30190#true} is_transmit3_triggered_~__retres1~7#1 := 0; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {30190#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {30190#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {30190#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {30190#true} {30191#false} #830#return; {30191#false} is VALID [2022-02-20 19:55:01,080 INFO L272 TraceCheckUtils]: 51: Hoare triple {30191#false} call reset_delta_events2(); {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {30246#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {30190#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {30190#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {30190#true} assume !(1 == ~T3_E~0); {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {30190#true} assume 1 == ~E_M~0;~E_M~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {30190#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {30190#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {30190#true} assume 1 == ~E_3~0;~E_3~0 := 2; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {30190#true} {30191#false} #832#return; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 62: Hoare triple {30191#false} assume !false; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 63: Hoare triple {30191#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {30191#false} assume !false; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L272 TraceCheckUtils]: 65: Hoare triple {30191#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {30190#true} havoc ~__retres1~8; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {30190#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {30190#true} #res := ~__retres1~8; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {30190#true} assume true; {30190#true} is VALID [2022-02-20 19:55:01,081 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {30190#true} {30191#false} #834#return; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {30191#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {30191#false} assume 0 != eval2_~tmp~4#1; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {30191#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {30191#false} is VALID [2022-02-20 19:55:01,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {30191#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {30191#false} is VALID [2022-02-20 19:55:01,082 INFO L290 TraceCheckUtils]: 75: Hoare triple {30191#false} assume !(0 == ~m_pc~0); {30191#false} is VALID [2022-02-20 19:55:01,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {30191#false} assume 1 == ~m_pc~0; {30191#false} is VALID [2022-02-20 19:55:01,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {30191#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {30191#false} is VALID [2022-02-20 19:55:01,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {30191#false} assume !false; {30191#false} is VALID [2022-02-20 19:55:01,082 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:55:01,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:01,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103581499] [2022-02-20 19:55:01,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103581499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:01,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:01,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:55:01,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268636824] [2022-02-20 19:55:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:01,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:01,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:01,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:01,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:55:01,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:55:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:55:01,138 INFO L87 Difference]: Start difference. First operand 1237 states and 1614 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:03,736 INFO L93 Difference]: Finished difference Result 1605 states and 2181 transitions. [2022-02-20 19:55:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:55:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:55:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:55:03,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 884 transitions. [2022-02-20 19:55:04,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 884 edges. 884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:04,558 INFO L225 Difference]: With dead ends: 1605 [2022-02-20 19:55:04,558 INFO L226 Difference]: Without dead ends: 1464 [2022-02-20 19:55:04,559 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:55:04,560 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 663 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:04,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [677 Valid, 884 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:55:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-02-20 19:55:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1379. [2022-02-20 19:55:04,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:04,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1464 states. Second operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:04,794 INFO L74 IsIncluded]: Start isIncluded. First operand 1464 states. Second operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:04,797 INFO L87 Difference]: Start difference. First operand 1464 states. Second operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:04,918 INFO L93 Difference]: Finished difference Result 1464 states and 1966 transitions. [2022-02-20 19:55:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1966 transitions. [2022-02-20 19:55:04,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:04,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:04,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) Second operand 1464 states. [2022-02-20 19:55:04,925 INFO L87 Difference]: Start difference. First operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) Second operand 1464 states. [2022-02-20 19:55:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:05,032 INFO L93 Difference]: Finished difference Result 1464 states and 1966 transitions. [2022-02-20 19:55:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1966 transitions. [2022-02-20 19:55:05,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:05,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:05,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:05,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1217 states have (on average 1.3114215283483976) internal successors, (1596), 1236 states have internal predecessors, (1596), 94 states have call successors, (94), 55 states have call predecessors, (94), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1828 transitions. [2022-02-20 19:55:05,142 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1828 transitions. Word has length 79 [2022-02-20 19:55:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:05,142 INFO L470 AbstractCegarLoop]: Abstraction has 1379 states and 1828 transitions. [2022-02-20 19:55:05,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1828 transitions. [2022-02-20 19:55:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:05,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:05,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:05,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:55:05,145 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -694307595, now seen corresponding path program 1 times [2022-02-20 19:55:05,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:05,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966454969] [2022-02-20 19:55:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,173 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37287#true} {37289#(= ~T1_E~0 ~M_E~0)} #826#return; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {37344#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:05,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {37344#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,206 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {37289#(= ~T1_E~0 ~M_E~0)} #828#return; {37288#false} is VALID [2022-02-20 19:55:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {37346#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {37287#true} assume 1 == ~m_pc~0; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {37287#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {37287#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {37287#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {37287#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {37287#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; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {37287#true} assume !(1 == ~t1_pc~0); {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {37287#true} is_transmit1_triggered_~__retres1~5#1 := 0; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {37287#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {37287#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {37287#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {37287#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; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {37287#true} assume 1 == ~t2_pc~0; {37287#true} is VALID [2022-02-20 19:55:05,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {37287#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {37287#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {37287#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {37287#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {37287#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {37287#true} assume !(1 == ~t3_pc~0); {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {37287#true} is_transmit3_triggered_~__retres1~7#1 := 0; {37287#true} is VALID [2022-02-20 19:55:05,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {37287#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37287#true} is VALID [2022-02-20 19:55:05,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {37287#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {37287#true} is VALID [2022-02-20 19:55:05,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {37287#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,227 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37287#true} {37288#false} #830#return; {37288#false} is VALID [2022-02-20 19:55:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {37287#true} is VALID [2022-02-20 19:55:05,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {37287#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {37287#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {37287#true} assume !(1 == ~T3_E~0); {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {37287#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {37287#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {37287#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {37287#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,234 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37287#true} {37288#false} #832#return; {37288#false} is VALID [2022-02-20 19:55:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {37287#true} havoc ~__retres1~8; {37287#true} is VALID [2022-02-20 19:55:05,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {37287#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37287#true} is VALID [2022-02-20 19:55:05,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {37287#true} #res := ~__retres1~8; {37287#true} is VALID [2022-02-20 19:55:05,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,237 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37287#true} {37288#false} #834#return; {37288#false} is VALID [2022-02-20 19:55:05,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {37287#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {37287#true} is VALID [2022-02-20 19:55:05,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,240 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37287#true} {37289#(= ~T1_E~0 ~M_E~0)} #826#return; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {37289#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {37289#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:05,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {37344#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:05,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {37344#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,247 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37345#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {37289#(= ~T1_E~0 ~M_E~0)} #828#return; {37288#false} is VALID [2022-02-20 19:55:05,247 INFO L272 TraceCheckUtils]: 24: Hoare triple {37288#false} call activate_threads2(); {37346#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:05,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {37346#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {37287#true} assume 1 == ~m_pc~0; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {37287#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {37287#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {37287#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {37287#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {37287#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; {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {37287#true} assume !(1 == ~t1_pc~0); {37287#true} is VALID [2022-02-20 19:55:05,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {37287#true} is_transmit1_triggered_~__retres1~5#1 := 0; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {37287#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {37287#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {37287#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {37287#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; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {37287#true} assume 1 == ~t2_pc~0; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {37287#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {37287#true} is VALID [2022-02-20 19:55:05,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {37287#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {37287#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {37287#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {37287#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {37287#true} assume !(1 == ~t3_pc~0); {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {37287#true} is_transmit3_triggered_~__retres1~7#1 := 0; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {37287#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {37287#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {37287#true} is VALID [2022-02-20 19:55:05,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {37287#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37287#true} is VALID [2022-02-20 19:55:05,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,251 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37287#true} {37288#false} #830#return; {37288#false} is VALID [2022-02-20 19:55:05,251 INFO L272 TraceCheckUtils]: 51: Hoare triple {37288#false} call reset_delta_events2(); {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:05,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {37343#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {37287#true} is VALID [2022-02-20 19:55:05,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {37287#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {37287#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {37287#true} assume !(1 == ~T3_E~0); {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {37287#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {37287#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {37287#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {37287#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,252 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {37287#true} {37288#false} #832#return; {37288#false} is VALID [2022-02-20 19:55:05,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {37288#false} assume !false; {37288#false} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {37288#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {37288#false} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {37288#false} assume !false; {37288#false} is VALID [2022-02-20 19:55:05,253 INFO L272 TraceCheckUtils]: 65: Hoare triple {37288#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {37287#true} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {37287#true} havoc ~__retres1~8; {37287#true} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {37287#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37287#true} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {37287#true} #res := ~__retres1~8; {37287#true} is VALID [2022-02-20 19:55:05,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {37287#true} assume true; {37287#true} is VALID [2022-02-20 19:55:05,254 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {37287#true} {37288#false} #834#return; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {37288#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {37288#false} assume 0 != eval2_~tmp~4#1; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 73: Hoare triple {37288#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 74: Hoare triple {37288#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 75: Hoare triple {37288#false} assume !(0 == ~m_pc~0); {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 76: Hoare triple {37288#false} assume 1 == ~m_pc~0; {37288#false} is VALID [2022-02-20 19:55:05,254 INFO L290 TraceCheckUtils]: 77: Hoare triple {37288#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {37288#false} is VALID [2022-02-20 19:55:05,255 INFO L290 TraceCheckUtils]: 78: Hoare triple {37288#false} assume !false; {37288#false} is VALID [2022-02-20 19:55:05,255 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:55:05,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:05,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966454969] [2022-02-20 19:55:05,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966454969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:05,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:05,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:05,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444397431] [2022-02-20 19:55:05,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:05,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:05,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:05,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:05,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:05,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:05,305 INFO L87 Difference]: Start difference. First operand 1379 states and 1828 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:08,454 INFO L93 Difference]: Finished difference Result 1933 states and 2674 transitions. [2022-02-20 19:55:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:55:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 888 transitions. [2022-02-20 19:55:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 888 transitions. [2022-02-20 19:55:08,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 888 transitions. [2022-02-20 19:55:09,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:09,318 INFO L225 Difference]: With dead ends: 1933 [2022-02-20 19:55:09,319 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:55:09,320 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:55:09,320 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 661 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:09,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 1382 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:55:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:55:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1512. [2022-02-20 19:55:09,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:09,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:09,577 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:09,579 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:09,723 INFO L93 Difference]: Finished difference Result 1650 states and 2248 transitions. [2022-02-20 19:55:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2248 transitions. [2022-02-20 19:55:09,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:09,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:09,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1650 states. [2022-02-20 19:55:09,731 INFO L87 Difference]: Start difference. First operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1650 states. [2022-02-20 19:55:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:09,875 INFO L93 Difference]: Finished difference Result 1650 states and 2248 transitions. [2022-02-20 19:55:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2248 transitions. [2022-02-20 19:55:09,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:09,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:09,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:09,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1331 states have (on average 1.3260706235912847) internal successors, (1765), 1351 states have internal predecessors, (1765), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2023 transitions. [2022-02-20 19:55:10,042 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2023 transitions. Word has length 79 [2022-02-20 19:55:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:10,042 INFO L470 AbstractCegarLoop]: Abstraction has 1512 states and 2023 transitions. [2022-02-20 19:55:10,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2023 transitions. [2022-02-20 19:55:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:10,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:10,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:10,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:55:10,045 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -748700493, now seen corresponding path program 1 times [2022-02-20 19:55:10,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:10,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957009014] [2022-02-20 19:55:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,087 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {45363#true} {45365#(not (= ~T3_E~0 0))} #826#return; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T1_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T2_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume true; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,121 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45421#(= |old(~T3_E~0)| 0)} {45365#(not (= ~T3_E~0 0))} #828#return; {45364#false} is VALID [2022-02-20 19:55:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {45422#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {45363#true} is VALID [2022-02-20 19:55:10,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {45363#true} assume 1 == ~m_pc~0; {45363#true} is VALID [2022-02-20 19:55:10,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {45363#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {45363#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {45363#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {45363#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {45363#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; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {45363#true} assume !(1 == ~t1_pc~0); {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {45363#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45363#true} is VALID [2022-02-20 19:55:10,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {45363#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {45363#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {45363#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {45363#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; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {45363#true} assume 1 == ~t2_pc~0; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {45363#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {45363#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45363#true} is VALID [2022-02-20 19:55:10,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {45363#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {45363#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {45363#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {45363#true} assume !(1 == ~t3_pc~0); {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {45363#true} is_transmit3_triggered_~__retres1~7#1 := 0; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {45363#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {45363#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {45363#true} is VALID [2022-02-20 19:55:10,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {45363#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,144 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45363#true} {45364#false} #830#return; {45364#false} is VALID [2022-02-20 19:55:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {45363#true} is VALID [2022-02-20 19:55:10,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {45363#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {45363#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {45363#true} assume !(1 == ~T3_E~0); {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {45363#true} assume 1 == ~E_M~0;~E_M~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {45363#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {45363#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {45363#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,150 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45363#true} {45364#false} #832#return; {45364#false} is VALID [2022-02-20 19:55:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {45363#true} havoc ~__retres1~8; {45363#true} is VALID [2022-02-20 19:55:10,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {45363#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45363#true} is VALID [2022-02-20 19:55:10,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {45363#true} #res := ~__retres1~8; {45363#true} is VALID [2022-02-20 19:55:10,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,154 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45363#true} {45364#false} #834#return; {45364#false} is VALID [2022-02-20 19:55:10,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {45363#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {45365#(not (= ~T3_E~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {45365#(not (= ~T3_E~0 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {45365#(not (= ~T3_E~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {45365#(not (= ~T3_E~0 0))} call update_channels2(); {45363#true} is VALID [2022-02-20 19:55:10,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,157 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45363#true} {45365#(not (= ~T3_E~0 0))} #826#return; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {45365#(not (= ~T3_E~0 0))} assume { :begin_inline_init_threads2 } true; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {45365#(not (= ~T3_E~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {45365#(not (= ~T3_E~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {45365#(not (= ~T3_E~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {45365#(not (= ~T3_E~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {45365#(not (= ~T3_E~0 0))} assume { :end_inline_init_threads2 } true; {45365#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:10,159 INFO L272 TraceCheckUtils]: 13: Hoare triple {45365#(not (= ~T3_E~0 0))} call fire_delta_events2(); {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:10,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T1_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T2_E~0); {45420#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:10,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {45420#(= |old(~T3_E~0)| ~T3_E~0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {45421#(= |old(~T3_E~0)| 0)} assume true; {45421#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:10,163 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45421#(= |old(~T3_E~0)| 0)} {45365#(not (= ~T3_E~0 0))} #828#return; {45364#false} is VALID [2022-02-20 19:55:10,163 INFO L272 TraceCheckUtils]: 24: Hoare triple {45364#false} call activate_threads2(); {45422#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {45422#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {45363#true} assume 1 == ~m_pc~0; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {45363#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {45363#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {45363#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {45363#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {45363#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; {45363#true} is VALID [2022-02-20 19:55:10,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {45363#true} assume !(1 == ~t1_pc~0); {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {45363#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {45363#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {45363#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {45363#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {45363#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; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {45363#true} assume 1 == ~t2_pc~0; {45363#true} is VALID [2022-02-20 19:55:10,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {45363#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {45363#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {45363#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {45363#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {45363#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {45363#true} assume !(1 == ~t3_pc~0); {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {45363#true} is_transmit3_triggered_~__retres1~7#1 := 0; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {45363#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45363#true} is VALID [2022-02-20 19:55:10,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {45363#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {45363#true} is VALID [2022-02-20 19:55:10,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {45363#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45363#true} is VALID [2022-02-20 19:55:10,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,167 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {45363#true} {45364#false} #830#return; {45364#false} is VALID [2022-02-20 19:55:10,167 INFO L272 TraceCheckUtils]: 51: Hoare triple {45364#false} call reset_delta_events2(); {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:10,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {45419#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {45363#true} is VALID [2022-02-20 19:55:10,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {45363#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {45363#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {45363#true} assume !(1 == ~T3_E~0); {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {45363#true} assume 1 == ~E_M~0;~E_M~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {45363#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {45363#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {45363#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,168 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {45363#true} {45364#false} #832#return; {45364#false} is VALID [2022-02-20 19:55:10,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {45364#false} assume !false; {45364#false} is VALID [2022-02-20 19:55:10,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {45364#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {45364#false} is VALID [2022-02-20 19:55:10,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {45364#false} assume !false; {45364#false} is VALID [2022-02-20 19:55:10,169 INFO L272 TraceCheckUtils]: 65: Hoare triple {45364#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {45363#true} is VALID [2022-02-20 19:55:10,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {45363#true} havoc ~__retres1~8; {45363#true} is VALID [2022-02-20 19:55:10,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {45363#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45363#true} is VALID [2022-02-20 19:55:10,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {45363#true} #res := ~__retres1~8; {45363#true} is VALID [2022-02-20 19:55:10,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {45363#true} assume true; {45363#true} is VALID [2022-02-20 19:55:10,170 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45363#true} {45364#false} #834#return; {45364#false} is VALID [2022-02-20 19:55:10,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {45364#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {45364#false} is VALID [2022-02-20 19:55:10,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {45364#false} assume 0 != eval2_~tmp~4#1; {45364#false} is VALID [2022-02-20 19:55:10,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {45364#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {45364#false} is VALID [2022-02-20 19:55:10,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {45364#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {45364#false} is VALID [2022-02-20 19:55:10,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {45364#false} assume !(0 == ~m_pc~0); {45364#false} is VALID [2022-02-20 19:55:10,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {45364#false} assume 1 == ~m_pc~0; {45364#false} is VALID [2022-02-20 19:55:10,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {45364#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {45364#false} is VALID [2022-02-20 19:55:10,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {45364#false} assume !false; {45364#false} is VALID [2022-02-20 19:55:10,173 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:55:10,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:10,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957009014] [2022-02-20 19:55:10,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957009014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:10,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:10,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:10,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127699746] [2022-02-20 19:55:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:10,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:10,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:10,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:10,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:10,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:10,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:10,223 INFO L87 Difference]: Start difference. First operand 1512 states and 2023 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:12,075 INFO L93 Difference]: Finished difference Result 2066 states and 2875 transitions. [2022-02-20 19:55:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:55:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2022-02-20 19:55:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2022-02-20 19:55:12,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 613 transitions. [2022-02-20 19:55:12,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:12,776 INFO L225 Difference]: With dead ends: 2066 [2022-02-20 19:55:12,777 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:55:12,778 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:55:12,779 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 544 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:12,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 860 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:55:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1512. [2022-02-20 19:55:13,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:13,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:13,007 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:13,008 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:13,113 INFO L93 Difference]: Finished difference Result 1650 states and 2247 transitions. [2022-02-20 19:55:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2247 transitions. [2022-02-20 19:55:13,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:13,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:13,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1650 states. [2022-02-20 19:55:13,122 INFO L87 Difference]: Start difference. First operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1650 states. [2022-02-20 19:55:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:13,270 INFO L93 Difference]: Finished difference Result 1650 states and 2247 transitions. [2022-02-20 19:55:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2247 transitions. [2022-02-20 19:55:13,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:13,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:13,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:13,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1331 states have (on average 1.32381667918858) internal successors, (1762), 1351 states have internal predecessors, (1762), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2020 transitions. [2022-02-20 19:55:13,440 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2020 transitions. Word has length 79 [2022-02-20 19:55:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:13,440 INFO L470 AbstractCegarLoop]: Abstraction has 1512 states and 2020 transitions. [2022-02-20 19:55:13,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2020 transitions. [2022-02-20 19:55:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:13,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:13,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:13,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:55:13,443 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -69428239, now seen corresponding path program 1 times [2022-02-20 19:55:13,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:13,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464649782] [2022-02-20 19:55:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,480 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {53604#true} {53606#(not (= ~E_M~0 0))} #826#return; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume true; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,510 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {53662#(= |old(~E_M~0)| 0)} {53606#(not (= ~E_M~0 0))} #828#return; {53605#false} is VALID [2022-02-20 19:55:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {53663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#true} assume 1 == ~m_pc~0; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {53604#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {53604#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {53604#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; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {53604#true} assume !(1 == ~t1_pc~0); {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {53604#true} is_transmit1_triggered_~__retres1~5#1 := 0; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {53604#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {53604#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {53604#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {53604#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; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {53604#true} assume 1 == ~t2_pc~0; {53604#true} is VALID [2022-02-20 19:55:13,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {53604#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {53604#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {53604#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {53604#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {53604#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {53604#true} assume !(1 == ~t3_pc~0); {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {53604#true} is_transmit3_triggered_~__retres1~7#1 := 0; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {53604#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {53604#true} is VALID [2022-02-20 19:55:13,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {53604#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {53604#true} is VALID [2022-02-20 19:55:13,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {53604#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,532 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {53604#true} {53605#false} #830#return; {53605#false} is VALID [2022-02-20 19:55:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {53604#true} is VALID [2022-02-20 19:55:13,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {53604#true} assume !(1 == ~T3_E~0); {53604#true} is VALID [2022-02-20 19:55:13,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {53604#true} assume 1 == ~E_M~0;~E_M~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} assume 1 == ~E_1~0;~E_1~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {53604#true} assume 1 == ~E_2~0;~E_2~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {53604#true} assume 1 == ~E_3~0;~E_3~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,539 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {53604#true} {53605#false} #832#return; {53605#false} is VALID [2022-02-20 19:55:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:13,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {53604#true} havoc ~__retres1~8; {53604#true} is VALID [2022-02-20 19:55:13,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {53604#true} is VALID [2022-02-20 19:55:13,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} #res := ~__retres1~8; {53604#true} is VALID [2022-02-20 19:55:13,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,543 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53604#true} {53605#false} #834#return; {53605#false} is VALID [2022-02-20 19:55:13,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {53604#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {53606#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {53606#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {53606#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {53606#(not (= ~E_M~0 0))} call update_channels2(); {53604#true} is VALID [2022-02-20 19:55:13,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,545 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53604#true} {53606#(not (= ~E_M~0 0))} #826#return; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {53606#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {53606#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {53606#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {53606#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {53606#(not (= ~E_M~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {53606#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {53606#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:13,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {53606#(not (= ~E_M~0 0))} call fire_delta_events2(); {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:13,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {53661#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:13,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {53661#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {53662#(= |old(~E_M~0)| 0)} assume true; {53662#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:13,551 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {53662#(= |old(~E_M~0)| 0)} {53606#(not (= ~E_M~0 0))} #828#return; {53605#false} is VALID [2022-02-20 19:55:13,552 INFO L272 TraceCheckUtils]: 24: Hoare triple {53605#false} call activate_threads2(); {53663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {53663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {53604#true} assume 1 == ~m_pc~0; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {53604#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {53604#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {53604#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {53604#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {53604#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; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {53604#true} assume !(1 == ~t1_pc~0); {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {53604#true} is_transmit1_triggered_~__retres1~5#1 := 0; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {53604#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {53604#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {53604#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {53604#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; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {53604#true} assume 1 == ~t2_pc~0; {53604#true} is VALID [2022-02-20 19:55:13,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {53604#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {53604#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {53604#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {53604#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {53604#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {53604#true} assume !(1 == ~t3_pc~0); {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {53604#true} is_transmit3_triggered_~__retres1~7#1 := 0; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {53604#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {53604#true} is VALID [2022-02-20 19:55:13,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {53604#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {53604#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {53604#true} {53605#false} #830#return; {53605#false} is VALID [2022-02-20 19:55:13,555 INFO L272 TraceCheckUtils]: 51: Hoare triple {53605#false} call reset_delta_events2(); {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {53660#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {53604#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {53604#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {53604#true} assume !(1 == ~T3_E~0); {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {53604#true} assume 1 == ~E_M~0;~E_M~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {53604#true} assume 1 == ~E_1~0;~E_1~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {53604#true} assume 1 == ~E_2~0;~E_2~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {53604#true} assume 1 == ~E_3~0;~E_3~0 := 2; {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,556 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {53604#true} {53605#false} #832#return; {53605#false} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-02-20 19:55:13,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {53605#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {53605#false} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-02-20 19:55:13,557 INFO L272 TraceCheckUtils]: 65: Hoare triple {53605#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {53604#true} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {53604#true} havoc ~__retres1~8; {53604#true} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {53604#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {53604#true} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {53604#true} #res := ~__retres1~8; {53604#true} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-02-20 19:55:13,557 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {53604#true} {53605#false} #834#return; {53605#false} is VALID [2022-02-20 19:55:13,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {53605#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {53605#false} assume 0 != eval2_~tmp~4#1; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 73: Hoare triple {53605#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {53605#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {53605#false} assume !(0 == ~m_pc~0); {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {53605#false} assume 1 == ~m_pc~0; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 77: Hoare triple {53605#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {53605#false} is VALID [2022-02-20 19:55:13,558 INFO L290 TraceCheckUtils]: 78: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-02-20 19:55:13,559 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:55:13,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:13,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464649782] [2022-02-20 19:55:13,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464649782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:13,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:13,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:13,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461661984] [2022-02-20 19:55:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:13,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:13,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:13,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:13,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:13,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:13,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:13,619 INFO L87 Difference]: Start difference. First operand 1512 states and 2020 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:15,632 INFO L93 Difference]: Finished difference Result 2062 states and 2858 transitions. [2022-02-20 19:55:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:55:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 608 transitions. [2022-02-20 19:55:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 608 transitions. [2022-02-20 19:55:15,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 608 transitions. [2022-02-20 19:55:16,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:16,209 INFO L225 Difference]: With dead ends: 2062 [2022-02-20 19:55:16,209 INFO L226 Difference]: Without dead ends: 1646 [2022-02-20 19:55:16,210 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:55:16,210 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 522 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:16,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 864 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:55:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-02-20 19:55:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1512. [2022-02-20 19:55:16,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:16,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1646 states. Second operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:16,440 INFO L74 IsIncluded]: Start isIncluded. First operand 1646 states. Second operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:16,442 INFO L87 Difference]: Start difference. First operand 1646 states. Second operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:16,577 INFO L93 Difference]: Finished difference Result 1646 states and 2233 transitions. [2022-02-20 19:55:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2233 transitions. [2022-02-20 19:55:16,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:16,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:16,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1646 states. [2022-02-20 19:55:16,585 INFO L87 Difference]: Start difference. First operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1646 states. [2022-02-20 19:55:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:16,727 INFO L93 Difference]: Finished difference Result 1646 states and 2233 transitions. [2022-02-20 19:55:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2233 transitions. [2022-02-20 19:55:16,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:16,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:16,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:16,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1331 states have (on average 1.3215627347858754) internal successors, (1759), 1351 states have internal predecessors, (1759), 106 states have call successors, (106), 61 states have call predecessors, (106), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2017 transitions. [2022-02-20 19:55:16,895 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2017 transitions. Word has length 79 [2022-02-20 19:55:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:16,896 INFO L470 AbstractCegarLoop]: Abstraction has 1512 states and 2017 transitions. [2022-02-20 19:55:16,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2017 transitions. [2022-02-20 19:55:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:16,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:16,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:16,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:55:16,899 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1892146419, now seen corresponding path program 1 times [2022-02-20 19:55:16,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:16,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079882411] [2022-02-20 19:55:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:16,933 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {61833#true} {61835#(= ~E_1~0 ~M_E~0)} #826#return; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:16,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:16,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:16,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:16,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:16,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:16,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:16,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:16,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:16,964 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {61835#(= ~E_1~0 ~M_E~0)} #828#return; {61834#false} is VALID [2022-02-20 19:55:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {61892#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {61833#true} assume 1 == ~m_pc~0; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {61833#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {61833#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {61833#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {61833#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:16,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {61833#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; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {61833#true} assume !(1 == ~t1_pc~0); {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {61833#true} is_transmit1_triggered_~__retres1~5#1 := 0; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {61833#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {61833#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {61833#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {61833#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; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {61833#true} assume 1 == ~t2_pc~0; {61833#true} is VALID [2022-02-20 19:55:16,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {61833#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {61833#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {61833#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {61833#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {61833#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {61833#true} assume !(1 == ~t3_pc~0); {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {61833#true} is_transmit3_triggered_~__retres1~7#1 := 0; {61833#true} is VALID [2022-02-20 19:55:16,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {61833#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {61833#true} is VALID [2022-02-20 19:55:16,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {61833#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {61833#true} is VALID [2022-02-20 19:55:16,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {61833#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:16,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:16,986 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {61833#true} {61834#false} #830#return; {61834#false} is VALID [2022-02-20 19:55:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {61833#true} is VALID [2022-02-20 19:55:16,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {61833#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {61833#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {61833#true} assume !(1 == ~T3_E~0); {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {61833#true} assume 1 == ~E_M~0;~E_M~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {61833#true} assume 1 == ~E_1~0;~E_1~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {61833#true} assume 1 == ~E_2~0;~E_2~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {61833#true} assume 1 == ~E_3~0;~E_3~0 := 2; {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:16,991 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {61833#true} {61834#false} #832#return; {61834#false} is VALID [2022-02-20 19:55:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {61833#true} havoc ~__retres1~8; {61833#true} is VALID [2022-02-20 19:55:16,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {61833#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {61833#true} is VALID [2022-02-20 19:55:16,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {61833#true} #res := ~__retres1~8; {61833#true} is VALID [2022-02-20 19:55:16,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:16,994 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {61833#true} {61834#false} #834#return; {61834#false} is VALID [2022-02-20 19:55:16,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {61833#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} call update_channels2(); {61833#true} is VALID [2022-02-20 19:55:16,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:16,997 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {61833#true} {61835#(= ~E_1~0 ~M_E~0)} #826#return; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {61835#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:16,999 INFO L272 TraceCheckUtils]: 13: Hoare triple {61835#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:17,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:17,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:17,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:17,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:17,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:17,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {61890#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:17,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:17,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:17,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:17,003 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {61891#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {61835#(= ~E_1~0 ~M_E~0)} #828#return; {61834#false} is VALID [2022-02-20 19:55:17,003 INFO L272 TraceCheckUtils]: 24: Hoare triple {61834#false} call activate_threads2(); {61892#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:17,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {61892#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {61833#true} is VALID [2022-02-20 19:55:17,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {61833#true} assume 1 == ~m_pc~0; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {61833#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {61833#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {61833#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {61833#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {61833#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; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {61833#true} assume !(1 == ~t1_pc~0); {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {61833#true} is_transmit1_triggered_~__retres1~5#1 := 0; {61833#true} is VALID [2022-02-20 19:55:17,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {61833#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {61833#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {61833#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {61833#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; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {61833#true} assume 1 == ~t2_pc~0; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {61833#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {61833#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {61833#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {61833#true} is VALID [2022-02-20 19:55:17,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {61833#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {61833#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {61833#true} assume !(1 == ~t3_pc~0); {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {61833#true} is_transmit3_triggered_~__retres1~7#1 := 0; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {61833#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {61833#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {61833#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {61833#true} is VALID [2022-02-20 19:55:17,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {61833#true} {61834#false} #830#return; {61834#false} is VALID [2022-02-20 19:55:17,007 INFO L272 TraceCheckUtils]: 51: Hoare triple {61834#false} call reset_delta_events2(); {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {61889#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {61833#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {61833#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {61833#true} assume !(1 == ~T3_E~0); {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {61833#true} assume 1 == ~E_M~0;~E_M~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {61833#true} assume 1 == ~E_1~0;~E_1~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {61833#true} assume 1 == ~E_2~0;~E_2~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {61833#true} assume 1 == ~E_3~0;~E_3~0 := 2; {61833#true} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:17,008 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {61833#true} {61834#false} #832#return; {61834#false} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {61834#false} assume !false; {61834#false} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {61834#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {61834#false} is VALID [2022-02-20 19:55:17,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {61834#false} assume !false; {61834#false} is VALID [2022-02-20 19:55:17,009 INFO L272 TraceCheckUtils]: 65: Hoare triple {61834#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {61833#true} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {61833#true} havoc ~__retres1~8; {61833#true} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 67: Hoare triple {61833#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {61833#true} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {61833#true} #res := ~__retres1~8; {61833#true} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {61833#true} assume true; {61833#true} is VALID [2022-02-20 19:55:17,009 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {61833#true} {61834#false} #834#return; {61834#false} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 71: Hoare triple {61834#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {61834#false} is VALID [2022-02-20 19:55:17,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {61834#false} assume 0 != eval2_~tmp~4#1; {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {61834#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {61834#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 75: Hoare triple {61834#false} assume !(0 == ~m_pc~0); {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 76: Hoare triple {61834#false} assume 1 == ~m_pc~0; {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 77: Hoare triple {61834#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {61834#false} is VALID [2022-02-20 19:55:17,010 INFO L290 TraceCheckUtils]: 78: Hoare triple {61834#false} assume !false; {61834#false} is VALID [2022-02-20 19:55:17,011 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:55:17,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:17,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079882411] [2022-02-20 19:55:17,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079882411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:17,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:17,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:17,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194581122] [2022-02-20 19:55:17,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:17,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:17,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:17,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:17,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:17,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:17,065 INFO L87 Difference]: Start difference. First operand 1512 states and 2017 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:20,511 INFO L93 Difference]: Finished difference Result 2484 states and 3469 transitions. [2022-02-20 19:55:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:55:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 935 transitions. [2022-02-20 19:55:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 935 transitions. [2022-02-20 19:55:20,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 935 transitions. [2022-02-20 19:55:21,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 935 edges. 935 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:21,427 INFO L225 Difference]: With dead ends: 2484 [2022-02-20 19:55:21,427 INFO L226 Difference]: Without dead ends: 2068 [2022-02-20 19:55:21,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:55:21,430 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 663 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:21,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 1388 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:55:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-02-20 19:55:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1772. [2022-02-20 19:55:21,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:21,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2068 states. Second operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) [2022-02-20 19:55:21,689 INFO L74 IsIncluded]: Start isIncluded. First operand 2068 states. Second operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) [2022-02-20 19:55:21,690 INFO L87 Difference]: Start difference. First operand 2068 states. Second operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) [2022-02-20 19:55:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:21,908 INFO L93 Difference]: Finished difference Result 2068 states and 2849 transitions. [2022-02-20 19:55:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2849 transitions. [2022-02-20 19:55:21,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:21,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:21,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) Second operand 2068 states. [2022-02-20 19:55:21,917 INFO L87 Difference]: Start difference. First operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) Second operand 2068 states. [2022-02-20 19:55:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:22,058 INFO L93 Difference]: Finished difference Result 2068 states and 2849 transitions. [2022-02-20 19:55:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2849 transitions. [2022-02-20 19:55:22,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:22,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:22,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:22,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1555 states have (on average 1.342765273311897) internal successors, (2088), 1577 states have internal predecessors, (2088), 128 states have call successors, (128), 73 states have call predecessors, (128), 87 states have return successors, (182), 125 states have call predecessors, (182), 127 states have call successors, (182) [2022-02-20 19:55:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2398 transitions. [2022-02-20 19:55:22,278 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2398 transitions. Word has length 79 [2022-02-20 19:55:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:22,278 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 2398 transitions. [2022-02-20 19:55:22,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2398 transitions. [2022-02-20 19:55:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:22,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:22,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:22,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:55:22,281 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2093970353, now seen corresponding path program 1 times [2022-02-20 19:55:22,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:22,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047560775] [2022-02-20 19:55:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,311 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {71799#true} {71801#(= ~E_2~0 ~M_E~0)} #826#return; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,348 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {71801#(= ~E_2~0 ~M_E~0)} #828#return; {71800#false} is VALID [2022-02-20 19:55:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {71858#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {71799#true} is VALID [2022-02-20 19:55:22,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {71799#true} assume 1 == ~m_pc~0; {71799#true} is VALID [2022-02-20 19:55:22,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {71799#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {71799#true} is VALID [2022-02-20 19:55:22,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {71799#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {71799#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {71799#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {71799#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; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {71799#true} assume !(1 == ~t1_pc~0); {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {71799#true} is_transmit1_triggered_~__retres1~5#1 := 0; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {71799#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {71799#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {71799#true} is VALID [2022-02-20 19:55:22,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {71799#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {71799#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; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {71799#true} assume 1 == ~t2_pc~0; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {71799#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {71799#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {71799#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {71799#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {71799#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {71799#true} assume !(1 == ~t3_pc~0); {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {71799#true} is_transmit3_triggered_~__retres1~7#1 := 0; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {71799#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {71799#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {71799#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,375 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {71799#true} {71800#false} #830#return; {71800#false} is VALID [2022-02-20 19:55:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {71799#true} is VALID [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {71799#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {71799#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {71799#true} assume !(1 == ~T3_E~0); {71799#true} is VALID [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {71799#true} assume 1 == ~E_M~0;~E_M~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {71799#true} assume 1 == ~E_1~0;~E_1~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {71799#true} assume 1 == ~E_2~0;~E_2~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {71799#true} assume 1 == ~E_3~0;~E_3~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,382 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {71799#true} {71800#false} #832#return; {71800#false} is VALID [2022-02-20 19:55:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:22,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {71799#true} havoc ~__retres1~8; {71799#true} is VALID [2022-02-20 19:55:22,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {71799#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {71799#true} is VALID [2022-02-20 19:55:22,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {71799#true} #res := ~__retres1~8; {71799#true} is VALID [2022-02-20 19:55:22,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,385 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {71799#true} {71800#false} #834#return; {71800#false} is VALID [2022-02-20 19:55:22,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {71799#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} call update_channels2(); {71799#true} is VALID [2022-02-20 19:55:22,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,389 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {71799#true} {71801#(= ~E_2~0 ~M_E~0)} #826#return; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {71801#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:22,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {71801#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:22,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:22,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {71856#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:22,395 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {71857#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {71801#(= ~E_2~0 ~M_E~0)} #828#return; {71800#false} is VALID [2022-02-20 19:55:22,396 INFO L272 TraceCheckUtils]: 24: Hoare triple {71800#false} call activate_threads2(); {71858#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {71858#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {71799#true} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {71799#true} assume 1 == ~m_pc~0; {71799#true} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {71799#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {71799#true} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {71799#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {71799#true} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {71799#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {71799#true} is VALID [2022-02-20 19:55:22,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {71799#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {71799#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; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {71799#true} assume !(1 == ~t1_pc~0); {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {71799#true} is_transmit1_triggered_~__retres1~5#1 := 0; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {71799#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {71799#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {71799#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {71799#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; {71799#true} is VALID [2022-02-20 19:55:22,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {71799#true} assume 1 == ~t2_pc~0; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {71799#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {71799#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {71799#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {71799#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {71799#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {71799#true} assume !(1 == ~t3_pc~0); {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {71799#true} is_transmit3_triggered_~__retres1~7#1 := 0; {71799#true} is VALID [2022-02-20 19:55:22,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {71799#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {71799#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {71799#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {71799#true} {71800#false} #830#return; {71800#false} is VALID [2022-02-20 19:55:22,399 INFO L272 TraceCheckUtils]: 51: Hoare triple {71800#false} call reset_delta_events2(); {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {71855#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {71799#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {71799#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {71799#true} assume !(1 == ~T3_E~0); {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {71799#true} assume 1 == ~E_M~0;~E_M~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {71799#true} assume 1 == ~E_1~0;~E_1~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {71799#true} assume 1 == ~E_2~0;~E_2~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {71799#true} assume 1 == ~E_3~0;~E_3~0 := 2; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,400 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {71799#true} {71800#false} #832#return; {71800#false} is VALID [2022-02-20 19:55:22,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {71800#false} assume !false; {71800#false} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {71800#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {71800#false} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {71800#false} assume !false; {71800#false} is VALID [2022-02-20 19:55:22,401 INFO L272 TraceCheckUtils]: 65: Hoare triple {71800#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {71799#true} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {71799#true} havoc ~__retres1~8; {71799#true} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {71799#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {71799#true} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {71799#true} #res := ~__retres1~8; {71799#true} is VALID [2022-02-20 19:55:22,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {71799#true} assume true; {71799#true} is VALID [2022-02-20 19:55:22,401 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {71799#true} {71800#false} #834#return; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 71: Hoare triple {71800#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {71800#false} assume 0 != eval2_~tmp~4#1; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {71800#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {71800#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {71800#false} assume !(0 == ~m_pc~0); {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {71800#false} assume 1 == ~m_pc~0; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {71800#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {71800#false} is VALID [2022-02-20 19:55:22,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {71800#false} assume !false; {71800#false} is VALID [2022-02-20 19:55:22,403 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:55:22,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:22,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047560775] [2022-02-20 19:55:22,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047560775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:22,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:22,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:22,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900296700] [2022-02-20 19:55:22,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:22,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:22,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:22,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:22,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:22,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:22,453 INFO L87 Difference]: Start difference. First operand 1772 states and 2398 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:26,013 INFO L93 Difference]: Finished difference Result 3400 states and 4812 transitions. [2022-02-20 19:55:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:55:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 914 transitions. [2022-02-20 19:55:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 914 transitions. [2022-02-20 19:55:26,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 914 transitions. [2022-02-20 19:55:26,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:27,038 INFO L225 Difference]: With dead ends: 3400 [2022-02-20 19:55:27,038 INFO L226 Difference]: Without dead ends: 2724 [2022-02-20 19:55:27,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:55:27,040 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 697 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:27,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 1343 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:55:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2022-02-20 19:55:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2293. [2022-02-20 19:55:27,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:27,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2724 states. Second operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand 2724 states. Second operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:27,339 INFO L87 Difference]: Start difference. First operand 2724 states. Second operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:27,617 INFO L93 Difference]: Finished difference Result 2724 states and 3805 transitions. [2022-02-20 19:55:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3805 transitions. [2022-02-20 19:55:27,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:27,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:27,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) Second operand 2724 states. [2022-02-20 19:55:27,626 INFO L87 Difference]: Start difference. First operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) Second operand 2724 states. [2022-02-20 19:55:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:27,972 INFO L93 Difference]: Finished difference Result 2724 states and 3805 transitions. [2022-02-20 19:55:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3805 transitions. [2022-02-20 19:55:27,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:27,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:27,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:27,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2006 states have (on average 1.3708873379860418) internal successors, (2750), 2032 states have internal predecessors, (2750), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3166 transitions. [2022-02-20 19:55:28,343 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3166 transitions. Word has length 79 [2022-02-20 19:55:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:28,343 INFO L470 AbstractCegarLoop]: Abstraction has 2293 states and 3166 transitions. [2022-02-20 19:55:28,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3166 transitions. [2022-02-20 19:55:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:28,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:28,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:28,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 19:55:28,346 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:28,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1640297165, now seen corresponding path program 1 times [2022-02-20 19:55:28,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:28,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756460130] [2022-02-20 19:55:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,375 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {84936#true} {84938#(not (= ~E_3~0 0))} #826#return; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T1_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T2_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T3_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_M~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_1~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_2~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume 0 == ~E_3~0;~E_3~0 := 1; {84994#(= |old(~E_3~0)| 0)} is VALID [2022-02-20 19:55:28,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {84994#(= |old(~E_3~0)| 0)} assume true; {84994#(= |old(~E_3~0)| 0)} is VALID [2022-02-20 19:55:28,408 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {84994#(= |old(~E_3~0)| 0)} {84938#(not (= ~E_3~0 0))} #828#return; {84937#false} is VALID [2022-02-20 19:55:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {84995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {84936#true} is VALID [2022-02-20 19:55:28,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {84936#true} assume 1 == ~m_pc~0; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {84936#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {84936#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {84936#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {84936#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {84936#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; {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {84936#true} assume !(1 == ~t1_pc~0); {84936#true} is VALID [2022-02-20 19:55:28,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {84936#true} is_transmit1_triggered_~__retres1~5#1 := 0; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {84936#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {84936#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {84936#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {84936#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; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {84936#true} assume 1 == ~t2_pc~0; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {84936#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {84936#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {84936#true} is VALID [2022-02-20 19:55:28,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {84936#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {84936#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {84936#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {84936#true} assume !(1 == ~t3_pc~0); {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {84936#true} is_transmit3_triggered_~__retres1~7#1 := 0; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {84936#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {84936#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {84936#true} is VALID [2022-02-20 19:55:28,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {84936#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,428 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {84936#true} {84937#false} #830#return; {84937#false} is VALID [2022-02-20 19:55:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {84936#true} is VALID [2022-02-20 19:55:28,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {84936#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {84936#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {84936#true} assume !(1 == ~T3_E~0); {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {84936#true} assume 1 == ~E_M~0;~E_M~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {84936#true} assume 1 == ~E_1~0;~E_1~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {84936#true} assume 1 == ~E_2~0;~E_2~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {84936#true} assume 1 == ~E_3~0;~E_3~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,433 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {84936#true} {84937#false} #832#return; {84937#false} is VALID [2022-02-20 19:55:28,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:28,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {84936#true} havoc ~__retres1~8; {84936#true} is VALID [2022-02-20 19:55:28,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {84936#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {84936#true} is VALID [2022-02-20 19:55:28,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {84936#true} #res := ~__retres1~8; {84936#true} is VALID [2022-02-20 19:55:28,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,437 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {84936#true} {84937#false} #834#return; {84937#false} is VALID [2022-02-20 19:55:28,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {84936#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {84938#(not (= ~E_3~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {84938#(not (= ~E_3~0 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {84938#(not (= ~E_3~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {84938#(not (= ~E_3~0 0))} call update_channels2(); {84936#true} is VALID [2022-02-20 19:55:28,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,440 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {84936#true} {84938#(not (= ~E_3~0 0))} #826#return; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {84938#(not (= ~E_3~0 0))} assume { :begin_inline_init_threads2 } true; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {84938#(not (= ~E_3~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {84938#(not (= ~E_3~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {84938#(not (= ~E_3~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {84938#(not (= ~E_3~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {84938#(not (= ~E_3~0 0))} assume { :end_inline_init_threads2 } true; {84938#(not (= ~E_3~0 0))} is VALID [2022-02-20 19:55:28,442 INFO L272 TraceCheckUtils]: 13: Hoare triple {84938#(not (= ~E_3~0 0))} call fire_delta_events2(); {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:28,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T1_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T2_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~T3_E~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_M~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_1~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume !(0 == ~E_2~0); {84993#(= ~E_3~0 |old(~E_3~0)|)} is VALID [2022-02-20 19:55:28,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {84993#(= ~E_3~0 |old(~E_3~0)|)} assume 0 == ~E_3~0;~E_3~0 := 1; {84994#(= |old(~E_3~0)| 0)} is VALID [2022-02-20 19:55:28,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {84994#(= |old(~E_3~0)| 0)} assume true; {84994#(= |old(~E_3~0)| 0)} is VALID [2022-02-20 19:55:28,446 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84994#(= |old(~E_3~0)| 0)} {84938#(not (= ~E_3~0 0))} #828#return; {84937#false} is VALID [2022-02-20 19:55:28,446 INFO L272 TraceCheckUtils]: 24: Hoare triple {84937#false} call activate_threads2(); {84995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:28,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {84995#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {84936#true} is VALID [2022-02-20 19:55:28,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {84936#true} assume 1 == ~m_pc~0; {84936#true} is VALID [2022-02-20 19:55:28,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {84936#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {84936#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {84936#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {84936#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {84936#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; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {84936#true} assume !(1 == ~t1_pc~0); {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {84936#true} is_transmit1_triggered_~__retres1~5#1 := 0; {84936#true} is VALID [2022-02-20 19:55:28,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {84936#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {84936#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {84936#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {84936#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; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {84936#true} assume 1 == ~t2_pc~0; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {84936#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {84936#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {84936#true} is VALID [2022-02-20 19:55:28,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {84936#true} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {84936#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {84936#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {84936#true} assume !(1 == ~t3_pc~0); {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {84936#true} is_transmit3_triggered_~__retres1~7#1 := 0; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {84936#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {84936#true} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {84936#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {84936#true} is VALID [2022-02-20 19:55:28,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,450 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {84936#true} {84937#false} #830#return; {84937#false} is VALID [2022-02-20 19:55:28,450 INFO L272 TraceCheckUtils]: 51: Hoare triple {84937#false} call reset_delta_events2(); {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:28,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {84992#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {84936#true} is VALID [2022-02-20 19:55:28,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {84936#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {84936#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {84936#true} assume !(1 == ~T3_E~0); {84936#true} is VALID [2022-02-20 19:55:28,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {84936#true} assume 1 == ~E_M~0;~E_M~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {84936#true} assume 1 == ~E_1~0;~E_1~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {84936#true} assume 1 == ~E_2~0;~E_2~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {84936#true} assume 1 == ~E_3~0;~E_3~0 := 2; {84936#true} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,451 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {84936#true} {84937#false} #832#return; {84937#false} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {84937#false} assume !false; {84937#false} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {84937#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {84937#false} is VALID [2022-02-20 19:55:28,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {84937#false} assume !false; {84937#false} is VALID [2022-02-20 19:55:28,452 INFO L272 TraceCheckUtils]: 65: Hoare triple {84937#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {84936#true} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 66: Hoare triple {84936#true} havoc ~__retres1~8; {84936#true} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {84936#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {84936#true} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {84936#true} #res := ~__retres1~8; {84936#true} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {84936#true} assume true; {84936#true} is VALID [2022-02-20 19:55:28,452 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {84936#true} {84937#false} #834#return; {84937#false} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 71: Hoare triple {84937#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {84937#false} is VALID [2022-02-20 19:55:28,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {84937#false} assume 0 != eval2_~tmp~4#1; {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {84937#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {84937#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 75: Hoare triple {84937#false} assume !(0 == ~m_pc~0); {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 76: Hoare triple {84937#false} assume 1 == ~m_pc~0; {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {84937#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {84937#false} is VALID [2022-02-20 19:55:28,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {84937#false} assume !false; {84937#false} is VALID [2022-02-20 19:55:28,454 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:55:28,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:28,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756460130] [2022-02-20 19:55:28,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756460130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:28,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:28,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:28,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59692474] [2022-02-20 19:55:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:28,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:28,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:28,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:28,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:28,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:28,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:28,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:28,516 INFO L87 Difference]: Start difference. First operand 2293 states and 3166 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:30,979 INFO L93 Difference]: Finished difference Result 3794 states and 5413 transitions. [2022-02-20 19:55:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:55:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 599 transitions. [2022-02-20 19:55:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 599 transitions. [2022-02-20 19:55:30,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 599 transitions. [2022-02-20 19:55:31,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:31,676 INFO L225 Difference]: With dead ends: 3794 [2022-02-20 19:55:31,677 INFO L226 Difference]: Without dead ends: 2597 [2022-02-20 19:55:31,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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:55:31,680 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 522 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:31,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 855 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2022-02-20 19:55:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2293. [2022-02-20 19:55:31,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:31,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2597 states. Second operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:31,959 INFO L74 IsIncluded]: Start isIncluded. First operand 2597 states. Second operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:31,961 INFO L87 Difference]: Start difference. First operand 2597 states. Second operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:32,187 INFO L93 Difference]: Finished difference Result 2597 states and 3624 transitions. [2022-02-20 19:55:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3624 transitions. [2022-02-20 19:55:32,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:32,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:32,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) Second operand 2597 states. [2022-02-20 19:55:32,195 INFO L87 Difference]: Start difference. First operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) Second operand 2597 states. [2022-02-20 19:55:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:32,404 INFO L93 Difference]: Finished difference Result 2597 states and 3624 transitions. [2022-02-20 19:55:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3624 transitions. [2022-02-20 19:55:32,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:32,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:32,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:32,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2006 states have (on average 1.3664007976071784) internal successors, (2741), 2032 states have internal predecessors, (2741), 170 states have call successors, (170), 97 states have call predecessors, (170), 115 states have return successors, (246), 171 states have call predecessors, (246), 169 states have call successors, (246) [2022-02-20 19:55:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3157 transitions. [2022-02-20 19:55:32,652 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3157 transitions. Word has length 79 [2022-02-20 19:55:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:32,652 INFO L470 AbstractCegarLoop]: Abstraction has 2293 states and 3157 transitions. [2022-02-20 19:55:32,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3157 transitions. [2022-02-20 19:55:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:55:32,654 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:32,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:32,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 19:55:32,655 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1206568079, now seen corresponding path program 1 times [2022-02-20 19:55:32,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:32,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103408674] [2022-02-20 19:55:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,680 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {98317#true} {98319#(= ~m_pc~0 0)} #826#return; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {98317#true} assume !(0 == ~T1_E~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {98317#true} assume !(0 == ~T2_E~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {98317#true} assume !(0 == ~T3_E~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {98317#true} assume !(0 == ~E_M~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {98317#true} assume !(0 == ~E_1~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {98317#true} assume !(0 == ~E_2~0); {98317#true} is VALID [2022-02-20 19:55:32,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {98317#true} assume !(0 == ~E_3~0); {98317#true} is VALID [2022-02-20 19:55:32,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,695 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {98317#true} {98319#(= ~m_pc~0 0)} #828#return; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {98374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {98317#true} is VALID [2022-02-20 19:55:32,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {98317#true} assume 1 == ~m_pc~0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {98375#(<= 1 ~m_pc~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp~5#1;~m_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {98375#(<= 1 ~m_pc~0)} 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; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {98375#(<= 1 ~m_pc~0)} assume !(1 == ~t1_pc~0); {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {98375#(<= 1 ~m_pc~0)} 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; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~t2_pc~0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {98375#(<= 1 ~m_pc~0)} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {98375#(<= 1 ~m_pc~0)} assume !(1 == ~t3_pc~0); {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit3_triggered_~__retres1~7#1 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {98375#(<= 1 ~m_pc~0)} assume true; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,726 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {98375#(<= 1 ~m_pc~0)} {98319#(= ~m_pc~0 0)} #830#return; {98318#false} is VALID [2022-02-20 19:55:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {98317#true} is VALID [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {98317#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {98317#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {98317#true} assume !(1 == ~T3_E~0); {98317#true} is VALID [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {98317#true} assume 1 == ~E_M~0;~E_M~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {98317#true} assume 1 == ~E_1~0;~E_1~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {98317#true} assume 1 == ~E_2~0;~E_2~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {98317#true} assume 1 == ~E_3~0;~E_3~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,732 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {98317#true} {98318#false} #832#return; {98318#false} is VALID [2022-02-20 19:55:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:32,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {98317#true} havoc ~__retres1~8; {98317#true} is VALID [2022-02-20 19:55:32,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {98317#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {98317#true} is VALID [2022-02-20 19:55:32,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {98317#true} #res := ~__retres1~8; {98317#true} is VALID [2022-02-20 19:55:32,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,735 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {98317#true} {98318#false} #834#return; {98318#false} is VALID [2022-02-20 19:55:32,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {98317#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;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {98319#(= ~m_pc~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {98319#(= ~m_pc~0 0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {98319#(= ~m_pc~0 0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {98319#(= ~m_pc~0 0)} call update_channels2(); {98317#true} is VALID [2022-02-20 19:55:32,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,737 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {98317#true} {98319#(= ~m_pc~0 0)} #826#return; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {98319#(= ~m_pc~0 0)} assume { :begin_inline_init_threads2 } true; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {98319#(= ~m_pc~0 0)} assume 1 == ~m_i~0;~m_st~0 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {98319#(= ~m_pc~0 0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {98319#(= ~m_pc~0 0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {98319#(= ~m_pc~0 0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {98319#(= ~m_pc~0 0)} assume { :end_inline_init_threads2 } true; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {98319#(= ~m_pc~0 0)} call fire_delta_events2(); {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:32,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {98317#true} is VALID [2022-02-20 19:55:32,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {98317#true} assume !(0 == ~T1_E~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {98317#true} assume !(0 == ~T2_E~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {98317#true} assume !(0 == ~T3_E~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {98317#true} assume !(0 == ~E_M~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {98317#true} assume !(0 == ~E_1~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {98317#true} assume !(0 == ~E_2~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {98317#true} assume !(0 == ~E_3~0); {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,740 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {98317#true} {98319#(= ~m_pc~0 0)} #828#return; {98319#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:32,741 INFO L272 TraceCheckUtils]: 24: Hoare triple {98319#(= ~m_pc~0 0)} call activate_threads2(); {98374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:55:32,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {98374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#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; {98317#true} is VALID [2022-02-20 19:55:32,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {98317#true} assume 1 == ~m_pc~0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {98375#(<= 1 ~m_pc~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~5#1 := #t~ret23#1;havoc #t~ret23#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp~5#1;~m_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {98375#(<= 1 ~m_pc~0)} 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; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {98375#(<= 1 ~m_pc~0)} assume !(1 == ~t1_pc~0); {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~2#1 := #t~ret24#1;havoc #t~ret24#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {98375#(<= 1 ~m_pc~0)} 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; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~t2_pc~0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret25#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___1~1#1 := #t~ret25#1;havoc #t~ret25#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {98375#(<= 1 ~m_pc~0)} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {98375#(<= 1 ~m_pc~0)} assume !(1 == ~t3_pc~0); {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit3_triggered_~__retres1~7#1 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {98375#(<= 1 ~m_pc~0)} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {98375#(<= 1 ~m_pc~0)} #t~ret26#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___2~0#1 := #t~ret26#1;havoc #t~ret26#1; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {98375#(<= 1 ~m_pc~0)} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {98375#(<= 1 ~m_pc~0)} assume true; {98375#(<= 1 ~m_pc~0)} is VALID [2022-02-20 19:55:32,749 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {98375#(<= 1 ~m_pc~0)} {98319#(= ~m_pc~0 0)} #830#return; {98318#false} is VALID [2022-02-20 19:55:32,749 INFO L272 TraceCheckUtils]: 51: Hoare triple {98318#false} call reset_delta_events2(); {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {98373#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {98317#true} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {98317#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {98317#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {98317#true} assume !(1 == ~T3_E~0); {98317#true} is VALID [2022-02-20 19:55:32,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {98317#true} assume 1 == ~E_M~0;~E_M~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {98317#true} assume 1 == ~E_1~0;~E_1~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {98317#true} assume 1 == ~E_2~0;~E_2~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {98317#true} assume 1 == ~E_3~0;~E_3~0 := 2; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {98317#true} {98318#false} #832#return; {98318#false} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {98318#false} assume !false; {98318#false} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {98318#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {98318#false} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {98318#false} assume !false; {98318#false} is VALID [2022-02-20 19:55:32,750 INFO L272 TraceCheckUtils]: 65: Hoare triple {98318#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {98317#true} havoc ~__retres1~8; {98317#true} is VALID [2022-02-20 19:55:32,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {98317#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {98317#true} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {98317#true} #res := ~__retres1~8; {98317#true} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {98317#true} assume true; {98317#true} is VALID [2022-02-20 19:55:32,751 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {98317#true} {98318#false} #834#return; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 71: Hoare triple {98318#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {98318#false} assume 0 != eval2_~tmp~4#1; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 73: Hoare triple {98318#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 74: Hoare triple {98318#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 75: Hoare triple {98318#false} assume !(0 == ~m_pc~0); {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {98318#false} assume 1 == ~m_pc~0; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {98318#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {98318#false} is VALID [2022-02-20 19:55:32,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {98318#false} assume !false; {98318#false} is VALID [2022-02-20 19:55:32,752 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:55:32,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:32,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103408674] [2022-02-20 19:55:32,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103408674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:32,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:32,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:55:32,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826317306] [2022-02-20 19:55:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:55:32,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:32,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:32,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:32,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:55:32,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:55:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:55:32,816 INFO L87 Difference]: Start difference. First operand 2293 states and 3157 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)