./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cb4eb95fbb86e81adddda10624c3164b4456d4761ce2ac967ea89c58c777ea3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:26:57,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:26:57,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:26:57,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:26:57,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:26:57,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:26:57,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:26:57,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:26:57,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:26:57,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:26:57,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:26:57,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:26:57,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:26:57,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:26:57,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:26:57,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:26:57,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:26:57,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:26:57,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:26:57,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:26:57,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:26:57,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:26:57,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:26:57,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:26:57,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:26:57,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:26:57,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:26:57,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:26:57,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:26:57,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:26:57,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:26:57,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:26:57,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:26:57,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:26:57,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:26:57,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:26:57,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:26:57,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:26:57,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:26:57,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:26:57,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:26:57,775 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:26:57,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:26:57,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:26:57,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:26:57,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:26:57,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:26:57,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:26:57,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:26:57,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:26:57,807 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:26:57,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:26:57,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:26:57,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:26:57,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:26:57,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:26:57,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:26:57,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:26:57,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:26:57,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:26:57,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:26:57,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:26:57,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:26:57,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:26:57,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:26:57,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:26:57,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:26:57,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:26:57,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:26:57,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:26:57,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:26:57,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:26:57,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:26:57,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:26:57,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:26:57,812 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 -> 1cb4eb95fbb86e81adddda10624c3164b4456d4761ce2ac967ea89c58c777ea3 [2022-02-20 19:26:58,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:26:58,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:26:58,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:26:58,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:26:58,063 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:26:58,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c [2022-02-20 19:26:58,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74202aca/27032c8892ff4a7ba00811557837fb75/FLAG2e4e3653e [2022-02-20 19:26:58,999 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:26:59,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c [2022-02-20 19:26:59,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74202aca/27032c8892ff4a7ba00811557837fb75/FLAG2e4e3653e [2022-02-20 19:26:59,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74202aca/27032c8892ff4a7ba00811557837fb75 [2022-02-20 19:26:59,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:26:59,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:26:59,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:26:59,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:26:59,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:26:59,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:59" (1/1) ... [2022-02-20 19:26:59,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014fca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:59, skipping insertion in model container [2022-02-20 19:26:59,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:59" (1/1) ... [2022-02-20 19:26:59,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:26:59,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:27:00,912 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/Problem05_label49+token_ring.04.cil-1.c[380593,380606] [2022-02-20 19:27:00,936 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/Problem05_label49+token_ring.04.cil-1.c[383339,383352] [2022-02-20 19:27:01,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:27:01,091 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:27:01,972 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/Problem05_label49+token_ring.04.cil-1.c[380593,380606] [2022-02-20 19:27:01,985 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/Problem05_label49+token_ring.04.cil-1.c[383339,383352] [2022-02-20 19:27:01,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:27:02,084 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:27:02,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02 WrapperNode [2022-02-20 19:27:02,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:27:02,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:27:02,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:27:02,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:27:02,094 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:27:02" (1/1) ... [2022-02-20 19:27:02,162 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:27:02" (1/1) ... [2022-02-20 19:27:02,640 INFO L137 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12735 [2022-02-20 19:27:02,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:27:02,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:27:02,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:27:02,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:27:02,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:02,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:02,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:02,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:03,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:03,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:03,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:03,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:27:03,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:27:03,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:27:03,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:27:03,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (1/1) ... [2022-02-20 19:27:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:27:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:27:03,332 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:27:03,346 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:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:27:03,381 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:27:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:27:03,382 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:27:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:27:03,382 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:27:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:27:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:27:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:27:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:27:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:27:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:27:03,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:27:03,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:27:03,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:27:03,496 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:27:03,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:27:09,954 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:27:09,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:27:09,982 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:27:09,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:27:09 BoogieIcfgContainer [2022-02-20 19:27:09,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:27:09,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:27:09,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:27:09,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:27:09,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:26:59" (1/3) ... [2022-02-20 19:27:09,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93841ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:27:09, skipping insertion in model container [2022-02-20 19:27:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:27:02" (2/3) ... [2022-02-20 19:27:09,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93841ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:27:09, skipping insertion in model container [2022-02-20 19:27:09,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:27:09" (3/3) ... [2022-02-20 19:27:09,993 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.04.cil-1.c [2022-02-20 19:27:09,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:27:09,997 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:27:10,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:27:10,049 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:27:10,049 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:27:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 2365 states, 2338 states have (on average 1.8541488451668093) internal successors, (4335), 2341 states have internal predecessors, (4335), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:27:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 19:27:10,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:10,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:27:10,133 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1353629608, now seen corresponding path program 1 times [2022-02-20 19:27:10,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:10,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810294752] [2022-02-20 19:27:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,390 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2368#true} {2370#(= ~t1_i~0 1)} #10804#return; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 19:27:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {2368#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {2368#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {2368#true} assume !(0 == ~T4_E~0); {2368#true} is VALID [2022-02-20 19:27:10,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#true} assume 0 == ~E_M~0;~E_M~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {2368#true} assume 0 == ~E_1~0;~E_1~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {2368#true} assume 0 == ~E_2~0;~E_2~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#true} assume 0 == ~E_3~0;~E_3~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#true} assume 0 == ~E_4~0;~E_4~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,449 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2368#true} {2369#false} #10806#return; {2369#false} is VALID [2022-02-20 19:27:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:27:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {2435#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2368#true} is VALID [2022-02-20 19:27:10,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {2368#true} assume 1 == ~m_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {2368#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2368#true} is VALID [2022-02-20 19:27:10,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {2368#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {2368#true} is VALID [2022-02-20 19:27:10,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {2368#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2368#true} is VALID [2022-02-20 19:27:10,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {2368#true} assume !(1 == ~t1_pc~0); {2368#true} is VALID [2022-02-20 19:27:10,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2368#true} is VALID [2022-02-20 19:27:10,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2368#true} is VALID [2022-02-20 19:27:10,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {2368#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {2368#true} is VALID [2022-02-20 19:27:10,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2368#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {2368#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2368#true} is VALID [2022-02-20 19:27:10,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {2368#true} assume 1 == ~t2_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {2368#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {2368#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2368#true} is VALID [2022-02-20 19:27:10,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {2368#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {2368#true} is VALID [2022-02-20 19:27:10,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {2368#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {2368#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {2368#true} is VALID [2022-02-20 19:27:10,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {2368#true} assume 1 == ~t3_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {2368#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {2368#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2368#true} is VALID [2022-02-20 19:27:10,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {2368#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {2368#true} is VALID [2022-02-20 19:27:10,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {2368#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {2368#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {2368#true} is VALID [2022-02-20 19:27:10,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {2368#true} assume !(1 == ~t4_pc~0); {2368#true} is VALID [2022-02-20 19:27:10,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {2368#true} is_transmit4_triggered_~__retres1~4#1 := 0; {2368#true} is VALID [2022-02-20 19:27:10,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {2368#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {2368#true} is VALID [2022-02-20 19:27:10,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {2368#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {2368#true} is VALID [2022-02-20 19:27:10,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {2368#true} assume !(0 != ~tmp___3~0#1); {2368#true} is VALID [2022-02-20 19:27:10,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,530 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2368#true} {2369#false} #10808#return; {2369#false} is VALID [2022-02-20 19:27:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 19:27:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2368#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#true} assume !(1 == ~T2_E~0); {2368#true} is VALID [2022-02-20 19:27:10,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {2368#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {2368#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {2368#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {2368#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#true} assume 1 == ~E_4~0;~E_4~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,553 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2368#true} {2369#false} #10810#return; {2369#false} is VALID [2022-02-20 19:27:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 19:27:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:10,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2368#true} havoc ~__retres1~5; {2368#true} is VALID [2022-02-20 19:27:10,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2368#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {2368#true} is VALID [2022-02-20 19:27:10,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#true} #res := ~__retres1~5; {2368#true} is VALID [2022-02-20 19:27:10,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,567 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2368#true} {2369#false} #10812#return; {2369#false} is VALID [2022-02-20 19:27:10,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2368#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2368#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {2368#true} is VALID [2022-02-20 19:27:10,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#true} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~6#1;havoc main2_~__retres1~6#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {2370#(= ~t1_i~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret40#1, start_simulation_#t~ret41#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#(= ~t1_i~0 1)} call update_channels(); {2368#true} is VALID [2022-02-20 19:27:10,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,576 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2368#true} {2370#(= ~t1_i~0 1)} #10804#return; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#(= ~t1_i~0 1)} assume { :begin_inline_init_threads } true; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#(= ~t1_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {2370#(= ~t1_i~0 1)} is VALID [2022-02-20 19:27:10,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#(= ~t1_i~0 1)} assume !(1 == ~t1_i~0);~t1_st~0 := 2; {2369#false} is VALID [2022-02-20 19:27:10,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {2369#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2369#false} is VALID [2022-02-20 19:27:10,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2369#false} assume 1 == ~t3_i~0;~t3_st~0 := 0; {2369#false} is VALID [2022-02-20 19:27:10,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {2369#false} assume 1 == ~t4_i~0;~t4_st~0 := 0; {2369#false} is VALID [2022-02-20 19:27:10,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {2369#false} assume { :end_inline_init_threads } true; {2369#false} is VALID [2022-02-20 19:27:10,581 INFO L272 TraceCheckUtils]: 14: Hoare triple {2369#false} call fire_delta_events(); {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:10,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {2368#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {2368#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {2368#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {2368#true} assume !(0 == ~T4_E~0); {2368#true} is VALID [2022-02-20 19:27:10,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {2368#true} assume 0 == ~E_M~0;~E_M~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {2368#true} assume 0 == ~E_1~0;~E_1~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {2368#true} assume 0 == ~E_2~0;~E_2~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {2368#true} assume 0 == ~E_3~0;~E_3~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {2368#true} assume 0 == ~E_4~0;~E_4~0 := 1; {2368#true} is VALID [2022-02-20 19:27:10,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,584 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2368#true} {2369#false} #10806#return; {2369#false} is VALID [2022-02-20 19:27:10,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {2369#false} call activate_threads(); {2435#(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) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 19:27:10,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {2435#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2368#true} is VALID [2022-02-20 19:27:10,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {2368#true} assume 1 == ~m_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {2368#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {2368#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2368#true} is VALID [2022-02-20 19:27:10,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {2368#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {2368#true} is VALID [2022-02-20 19:27:10,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {2368#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {2368#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2368#true} is VALID [2022-02-20 19:27:10,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {2368#true} assume !(1 == ~t1_pc~0); {2368#true} is VALID [2022-02-20 19:27:10,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {2368#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2368#true} is VALID [2022-02-20 19:27:10,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {2368#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2368#true} is VALID [2022-02-20 19:27:10,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {2368#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {2368#true} is VALID [2022-02-20 19:27:10,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {2368#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {2368#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2368#true} is VALID [2022-02-20 19:27:10,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {2368#true} assume 1 == ~t2_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {2368#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {2368#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2368#true} is VALID [2022-02-20 19:27:10,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {2368#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {2368#true} is VALID [2022-02-20 19:27:10,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {2368#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {2368#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {2368#true} is VALID [2022-02-20 19:27:10,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {2368#true} assume 1 == ~t3_pc~0; {2368#true} is VALID [2022-02-20 19:27:10,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {2368#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2368#true} is VALID [2022-02-20 19:27:10,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {2368#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2368#true} is VALID [2022-02-20 19:27:10,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {2368#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {2368#true} is VALID [2022-02-20 19:27:10,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {2368#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2368#true} is VALID [2022-02-20 19:27:10,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {2368#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {2368#true} is VALID [2022-02-20 19:27:10,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {2368#true} assume !(1 == ~t4_pc~0); {2368#true} is VALID [2022-02-20 19:27:10,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {2368#true} is_transmit4_triggered_~__retres1~4#1 := 0; {2368#true} is VALID [2022-02-20 19:27:10,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {2368#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {2368#true} is VALID [2022-02-20 19:27:10,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {2368#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {2368#true} is VALID [2022-02-20 19:27:10,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {2368#true} assume !(0 != ~tmp___3~0#1); {2368#true} is VALID [2022-02-20 19:27:10,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,596 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2368#true} {2369#false} #10808#return; {2369#false} is VALID [2022-02-20 19:27:10,596 INFO L272 TraceCheckUtils]: 60: Hoare triple {2369#false} call reset_delta_events(); {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:10,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {2434#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {2368#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {2368#true} assume !(1 == ~T2_E~0); {2368#true} is VALID [2022-02-20 19:27:10,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {2368#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {2368#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,612 INFO L290 TraceCheckUtils]: 66: Hoare triple {2368#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {2368#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,612 INFO L290 TraceCheckUtils]: 68: Hoare triple {2368#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,612 INFO L290 TraceCheckUtils]: 69: Hoare triple {2368#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,612 INFO L290 TraceCheckUtils]: 70: Hoare triple {2368#true} assume 1 == ~E_4~0;~E_4~0 := 2; {2368#true} is VALID [2022-02-20 19:27:10,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,613 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {2368#true} {2369#false} #10810#return; {2369#false} is VALID [2022-02-20 19:27:10,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {2369#false} assume !false; {2369#false} is VALID [2022-02-20 19:27:10,613 INFO L290 TraceCheckUtils]: 74: Hoare triple {2369#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_5~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2369#false} is VALID [2022-02-20 19:27:10,614 INFO L290 TraceCheckUtils]: 75: Hoare triple {2369#false} assume !false; {2369#false} is VALID [2022-02-20 19:27:10,614 INFO L272 TraceCheckUtils]: 76: Hoare triple {2369#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2368#true} is VALID [2022-02-20 19:27:10,614 INFO L290 TraceCheckUtils]: 77: Hoare triple {2368#true} havoc ~__retres1~5; {2368#true} is VALID [2022-02-20 19:27:10,614 INFO L290 TraceCheckUtils]: 78: Hoare triple {2368#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {2368#true} is VALID [2022-02-20 19:27:10,614 INFO L290 TraceCheckUtils]: 79: Hoare triple {2368#true} #res := ~__retres1~5; {2368#true} is VALID [2022-02-20 19:27:10,615 INFO L290 TraceCheckUtils]: 80: Hoare triple {2368#true} assume true; {2368#true} is VALID [2022-02-20 19:27:10,615 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {2368#true} {2369#false} #10812#return; {2369#false} is VALID [2022-02-20 19:27:10,615 INFO L290 TraceCheckUtils]: 82: Hoare triple {2369#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {2369#false} is VALID [2022-02-20 19:27:10,615 INFO L290 TraceCheckUtils]: 83: Hoare triple {2369#false} assume 0 != eval_~tmp~0#1; {2369#false} is VALID [2022-02-20 19:27:10,616 INFO L290 TraceCheckUtils]: 84: Hoare triple {2369#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {2369#false} is VALID [2022-02-20 19:27:10,616 INFO L290 TraceCheckUtils]: 85: Hoare triple {2369#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {2369#false} is VALID [2022-02-20 19:27:10,616 INFO L290 TraceCheckUtils]: 86: Hoare triple {2369#false} assume !(0 == ~m_pc~0); {2369#false} is VALID [2022-02-20 19:27:10,616 INFO L290 TraceCheckUtils]: 87: Hoare triple {2369#false} assume 1 == ~m_pc~0; {2369#false} is VALID [2022-02-20 19:27:10,616 INFO L290 TraceCheckUtils]: 88: Hoare triple {2369#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error } true; {2369#false} is VALID [2022-02-20 19:27:10,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {2369#false} assume !false; {2369#false} is VALID [2022-02-20 19:27:10,617 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:27:10,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:10,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810294752] [2022-02-20 19:27:10,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810294752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:10,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:10,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:27:10,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865220925] [2022-02-20 19:27:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2022-02-20 19:27:10,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:10,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:10,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:10,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:27:10,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:27:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:27:10,743 INFO L87 Difference]: Start difference. First operand has 2365 states, 2338 states have (on average 1.8541488451668093) internal successors, (4335), 2341 states have internal predecessors, (4335), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:20,449 INFO L93 Difference]: Finished difference Result 4778 states and 8824 transitions. [2022-02-20 19:27:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:27:20,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2022-02-20 19:27:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:27:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8824 transitions. [2022-02-20 19:27:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8824 transitions. [2022-02-20 19:27:20,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 8824 transitions. [2022-02-20 19:27:26,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8824 edges. 8824 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:27,358 INFO L225 Difference]: With dead ends: 4778 [2022-02-20 19:27:27,359 INFO L226 Difference]: Without dead ends: 2352 [2022-02-20 19:27:27,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:27:27,381 INFO L933 BasicCegarLoop]: 4315 mSDtfsCounter, 434 mSDsluCounter, 12257 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 16572 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:27:27,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 16572 Invalid, 343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:27:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2022-02-20 19:27:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2298. [2022-02-20 19:27:27,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:27,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2352 states. Second operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:27:27,551 INFO L74 IsIncluded]: Start isIncluded. First operand 2352 states. Second operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:27:27,559 INFO L87 Difference]: Start difference. First operand 2352 states. Second operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:27:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:27,811 INFO L93 Difference]: Finished difference Result 2352 states and 4317 transitions. [2022-02-20 19:27:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4317 transitions. [2022-02-20 19:27:27,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:27,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:27,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 2352 states. [2022-02-20 19:27:27,838 INFO L87 Difference]: Start difference. First operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 2352 states. [2022-02-20 19:27:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:28,099 INFO L93 Difference]: Finished difference Result 2352 states and 4317 transitions. [2022-02-20 19:27:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4317 transitions. [2022-02-20 19:27:28,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:28,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:28,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:28,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2272 states have (on average 1.8433098591549295) internal successors, (4188), 2274 states have internal predecessors, (4188), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:27:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 4224 transitions. [2022-02-20 19:27:28,383 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 4224 transitions. Word has length 90 [2022-02-20 19:27:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:28,384 INFO L470 AbstractCegarLoop]: Abstraction has 2298 states and 4224 transitions. [2022-02-20 19:27:28,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 4224 transitions. [2022-02-20 19:27:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 19:27:28,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:28,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:27:28,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:27:28,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -295791530, now seen corresponding path program 1 times [2022-02-20 19:27:28,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:28,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629261881] [2022-02-20 19:27:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,492 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14441#true} {14443#(= ~M_E~0 2)} #10804#return; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 19:27:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume !(0 == ~T4_E~0); {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume true; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,545 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14508#(= |old(~M_E~0)| 0)} {14443#(= ~M_E~0 2)} #10806#return; {14442#false} is VALID [2022-02-20 19:27:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:27:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {14509#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14441#true} is VALID [2022-02-20 19:27:28,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {14441#true} assume 1 == ~m_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {14441#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {14441#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14441#true} is VALID [2022-02-20 19:27:28,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {14441#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {14441#true} is VALID [2022-02-20 19:27:28,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {14441#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {14441#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {14441#true} is VALID [2022-02-20 19:27:28,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {14441#true} assume !(1 == ~t1_pc~0); {14441#true} is VALID [2022-02-20 19:27:28,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {14441#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {14441#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {14441#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {14441#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {14441#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {14441#true} assume 1 == ~t2_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {14441#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {14441#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {14441#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {14441#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {14441#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {14441#true} assume 1 == ~t3_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {14441#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {14441#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {14441#true} is VALID [2022-02-20 19:27:28,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {14441#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {14441#true} is VALID [2022-02-20 19:27:28,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {14441#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {14441#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {14441#true} is VALID [2022-02-20 19:27:28,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {14441#true} assume !(1 == ~t4_pc~0); {14441#true} is VALID [2022-02-20 19:27:28,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {14441#true} is_transmit4_triggered_~__retres1~4#1 := 0; {14441#true} is VALID [2022-02-20 19:27:28,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {14441#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {14441#true} is VALID [2022-02-20 19:27:28,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {14441#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {14441#true} is VALID [2022-02-20 19:27:28,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {14441#true} assume !(0 != ~tmp___3~0#1); {14441#true} is VALID [2022-02-20 19:27:28,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,588 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14441#true} {14442#false} #10808#return; {14442#false} is VALID [2022-02-20 19:27:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 19:27:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {14441#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {14441#true} assume !(1 == ~T2_E~0); {14441#true} is VALID [2022-02-20 19:27:28,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {14441#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {14441#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {14441#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {14441#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {14441#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {14441#true} assume 1 == ~E_3~0;~E_3~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {14441#true} assume 1 == ~E_4~0;~E_4~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,607 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14441#true} {14442#false} #10810#return; {14442#false} is VALID [2022-02-20 19:27:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 19:27:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:28,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {14441#true} havoc ~__retres1~5; {14441#true} is VALID [2022-02-20 19:27:28,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {14441#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {14441#true} is VALID [2022-02-20 19:27:28,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {14441#true} #res := ~__retres1~5; {14441#true} is VALID [2022-02-20 19:27:28,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,615 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14441#true} {14442#false} #10812#return; {14442#false} is VALID [2022-02-20 19:27:28,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {14441#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {14443#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {14443#(= ~M_E~0 2)} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~6#1;havoc main2_~__retres1~6#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {14443#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret40#1, start_simulation_#t~ret41#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {14443#(= ~M_E~0 2)} call update_channels(); {14441#true} is VALID [2022-02-20 19:27:28,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,618 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14441#true} {14443#(= ~M_E~0 2)} #10804#return; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {14443#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {14443#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {14443#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {14443#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {14443#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {14443#(= ~M_E~0 2)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {14443#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {14443#(= ~M_E~0 2)} is VALID [2022-02-20 19:27:28,627 INFO L272 TraceCheckUtils]: 14: Hoare triple {14443#(= ~M_E~0 2)} call fire_delta_events(); {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:28,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume !(0 == ~T4_E~0); {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {14508#(= |old(~M_E~0)| 0)} assume true; {14508#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:27:28,643 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14508#(= |old(~M_E~0)| 0)} {14443#(= ~M_E~0 2)} #10806#return; {14442#false} is VALID [2022-02-20 19:27:28,643 INFO L272 TraceCheckUtils]: 27: Hoare triple {14442#false} call activate_threads(); {14509#(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) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 19:27:28,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {14509#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14441#true} is VALID [2022-02-20 19:27:28,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {14441#true} assume 1 == ~m_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {14441#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {14441#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14441#true} is VALID [2022-02-20 19:27:28,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {14441#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {14441#true} is VALID [2022-02-20 19:27:28,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {14441#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {14441#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {14441#true} is VALID [2022-02-20 19:27:28,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {14441#true} assume !(1 == ~t1_pc~0); {14441#true} is VALID [2022-02-20 19:27:28,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {14441#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14441#true} is VALID [2022-02-20 19:27:28,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {14441#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14441#true} is VALID [2022-02-20 19:27:28,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {14441#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {14441#true} is VALID [2022-02-20 19:27:28,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {14441#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {14441#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14441#true} is VALID [2022-02-20 19:27:28,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {14441#true} assume 1 == ~t2_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {14441#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {14441#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14441#true} is VALID [2022-02-20 19:27:28,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {14441#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {14441#true} is VALID [2022-02-20 19:27:28,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {14441#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {14441#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#true} assume 1 == ~t3_pc~0; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {14441#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {14441#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {14441#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {14441#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {14441#true} is VALID [2022-02-20 19:27:28,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {14441#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {14441#true} is VALID [2022-02-20 19:27:28,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {14441#true} assume !(1 == ~t4_pc~0); {14441#true} is VALID [2022-02-20 19:27:28,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {14441#true} is_transmit4_triggered_~__retres1~4#1 := 0; {14441#true} is VALID [2022-02-20 19:27:28,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {14441#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {14441#true} is VALID [2022-02-20 19:27:28,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {14441#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {14441#true} is VALID [2022-02-20 19:27:28,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {14441#true} assume !(0 != ~tmp___3~0#1); {14441#true} is VALID [2022-02-20 19:27:28,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,656 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14441#true} {14442#false} #10808#return; {14442#false} is VALID [2022-02-20 19:27:28,656 INFO L272 TraceCheckUtils]: 60: Hoare triple {14442#false} call reset_delta_events(); {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:28,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {14507#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {14441#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {14441#true} assume !(1 == ~T2_E~0); {14441#true} is VALID [2022-02-20 19:27:28,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {14441#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {14441#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {14441#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {14441#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {14441#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {14441#true} assume 1 == ~E_3~0;~E_3~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {14441#true} assume 1 == ~E_4~0;~E_4~0 := 2; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,658 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14441#true} {14442#false} #10810#return; {14442#false} is VALID [2022-02-20 19:27:28,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {14442#false} assume !false; {14442#false} is VALID [2022-02-20 19:27:28,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {14442#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_5~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14442#false} is VALID [2022-02-20 19:27:28,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {14442#false} assume !false; {14442#false} is VALID [2022-02-20 19:27:28,659 INFO L272 TraceCheckUtils]: 76: Hoare triple {14442#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14441#true} is VALID [2022-02-20 19:27:28,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {14441#true} havoc ~__retres1~5; {14441#true} is VALID [2022-02-20 19:27:28,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {14441#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {14441#true} is VALID [2022-02-20 19:27:28,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {14441#true} #res := ~__retres1~5; {14441#true} is VALID [2022-02-20 19:27:28,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {14441#true} assume true; {14441#true} is VALID [2022-02-20 19:27:28,660 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14441#true} {14442#false} #10812#return; {14442#false} is VALID [2022-02-20 19:27:28,660 INFO L290 TraceCheckUtils]: 82: Hoare triple {14442#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {14442#false} is VALID [2022-02-20 19:27:28,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {14442#false} assume 0 != eval_~tmp~0#1; {14442#false} is VALID [2022-02-20 19:27:28,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {14442#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {14442#false} is VALID [2022-02-20 19:27:28,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {14442#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {14442#false} is VALID [2022-02-20 19:27:28,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {14442#false} assume !(0 == ~m_pc~0); {14442#false} is VALID [2022-02-20 19:27:28,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {14442#false} assume 1 == ~m_pc~0; {14442#false} is VALID [2022-02-20 19:27:28,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {14442#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error } true; {14442#false} is VALID [2022-02-20 19:27:28,663 INFO L290 TraceCheckUtils]: 89: Hoare triple {14442#false} assume !false; {14442#false} is VALID [2022-02-20 19:27:28,666 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:27:28,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:28,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629261881] [2022-02-20 19:27:28,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629261881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:28,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:28,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:27:28,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932858109] [2022-02-20 19:27:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2022-02-20 19:27:28,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:28,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:27:28,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:28,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:27:28,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:27:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:27:28,750 INFO L87 Difference]: Start difference. First operand 2298 states and 4224 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:27:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:40,027 INFO L93 Difference]: Finished difference Result 2738 states and 4911 transitions. [2022-02-20 19:27:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:27:40,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2022-02-20 19:27:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:27:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:27:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4911 transitions. [2022-02-20 19:27:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:27:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4911 transitions. [2022-02-20 19:27:40,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 4911 transitions. [2022-02-20 19:27:43,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4911 edges. 4911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:43,950 INFO L225 Difference]: With dead ends: 2738 [2022-02-20 19:27:43,951 INFO L226 Difference]: Without dead ends: 2573 [2022-02-20 19:27:43,956 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:27:43,958 INFO L933 BasicCegarLoop]: 4266 mSDtfsCounter, 4590 mSDsluCounter, 12314 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4601 SdHoareTripleChecker+Valid, 16580 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:27:43,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4601 Valid, 16580 Invalid, 931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:27:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2022-02-20 19:27:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2466. [2022-02-20 19:27:44,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:44,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2573 states. Second operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2022-02-20 19:27:44,045 INFO L74 IsIncluded]: Start isIncluded. First operand 2573 states. Second operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2022-02-20 19:27:44,051 INFO L87 Difference]: Start difference. First operand 2573 states. Second operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2022-02-20 19:27:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:44,426 INFO L93 Difference]: Finished difference Result 2573 states and 4657 transitions. [2022-02-20 19:27:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 4657 transitions. [2022-02-20 19:27:44,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:44,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:44,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) Second operand 2573 states. [2022-02-20 19:27:44,442 INFO L87 Difference]: Start difference. First operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) Second operand 2573 states. [2022-02-20 19:27:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:44,735 INFO L93 Difference]: Finished difference Result 2573 states and 4657 transitions. [2022-02-20 19:27:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 4657 transitions. [2022-02-20 19:27:44,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:44,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:44,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:44,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2420 states have (on average 1.824793388429752) internal successors, (4416), 2423 states have internal predecessors, (4416), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2022-02-20 19:27:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4481 transitions. [2022-02-20 19:27:44,999 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4481 transitions. Word has length 90 [2022-02-20 19:27:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:45,000 INFO L470 AbstractCegarLoop]: Abstraction has 2466 states and 4481 transitions. [2022-02-20 19:27:45,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:27:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4481 transitions. [2022-02-20 19:27:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 19:27:45,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:45,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:27:45,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:27:45,001 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1470450982, now seen corresponding path program 1 times [2022-02-20 19:27:45,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:45,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015373975] [2022-02-20 19:27:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,056 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {25180#true} {25182#(= ~T1_E~0 ~M_E~0)} #10804#return; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 19:27:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {25247#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:45,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {25247#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T4_E~0); {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,105 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {25182#(= ~T1_E~0 ~M_E~0)} #10806#return; {25181#false} is VALID [2022-02-20 19:27:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:27:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {25249#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {25180#true} assume 1 == ~m_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {25180#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {25180#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {25180#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {25180#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {25180#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {25180#true} assume !(1 == ~t1_pc~0); {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {25180#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {25180#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {25180#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {25180#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {25180#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25180#true} is VALID [2022-02-20 19:27:45,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {25180#true} assume 1 == ~t2_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {25180#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {25180#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25180#true} is VALID [2022-02-20 19:27:45,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {25180#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {25180#true} is VALID [2022-02-20 19:27:45,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {25180#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {25180#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {25180#true} assume 1 == ~t3_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {25180#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {25180#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {25180#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {25180#true} is VALID [2022-02-20 19:27:45,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {25180#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {25180#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {25180#true} assume !(1 == ~t4_pc~0); {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {25180#true} is_transmit4_triggered_~__retres1~4#1 := 0; {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {25180#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {25180#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {25180#true} is VALID [2022-02-20 19:27:45,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {25180#true} assume !(0 != ~tmp___3~0#1); {25180#true} is VALID [2022-02-20 19:27:45,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25180#true} {25181#false} #10808#return; {25181#false} is VALID [2022-02-20 19:27:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 19:27:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {25180#true} is VALID [2022-02-20 19:27:45,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {25180#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {25180#true} assume !(1 == ~T2_E~0); {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {25180#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {25180#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {25180#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {25180#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {25180#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {25180#true} assume 1 == ~E_3~0;~E_3~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {25180#true} assume 1 == ~E_4~0;~E_4~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,185 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25180#true} {25181#false} #10810#return; {25181#false} is VALID [2022-02-20 19:27:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 19:27:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:45,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {25180#true} havoc ~__retres1~5; {25180#true} is VALID [2022-02-20 19:27:45,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {25180#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {25180#true} is VALID [2022-02-20 19:27:45,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {25180#true} #res := ~__retres1~5; {25180#true} is VALID [2022-02-20 19:27:45,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,190 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25180#true} {25181#false} #10812#return; {25181#false} is VALID [2022-02-20 19:27:45,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {25180#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet42#1);havoc main_#t~nondet42#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~6#1;havoc main2_~__retres1~6#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret40#1, start_simulation_#t~ret41#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} call update_channels(); {25180#true} is VALID [2022-02-20 19:27:45,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,193 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25180#true} {25182#(= ~T1_E~0 ~M_E~0)} #10804#return; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {25182#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:27:45,197 INFO L272 TraceCheckUtils]: 14: Hoare triple {25182#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:45,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {25247#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:45,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {25247#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T4_E~0); {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:45,202 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25248#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {25182#(= ~T1_E~0 ~M_E~0)} #10806#return; {25181#false} is VALID [2022-02-20 19:27:45,202 INFO L272 TraceCheckUtils]: 27: Hoare triple {25181#false} call activate_threads(); {25249#(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) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 19:27:45,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {25249#(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) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {25180#true} is VALID [2022-02-20 19:27:45,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {25180#true} assume 1 == ~m_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {25180#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {25180#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {25180#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {25180#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {25180#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {25180#true} is VALID [2022-02-20 19:27:45,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {25180#true} assume !(1 == ~t1_pc~0); {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {25180#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {25180#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {25180#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {25180#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {25180#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {25180#true} assume 1 == ~t2_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {25180#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {25180#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {25180#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {25180#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {25180#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {25180#true} assume 1 == ~t3_pc~0; {25180#true} is VALID [2022-02-20 19:27:45,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {25180#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {25180#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 50: Hoare triple {25180#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {25180#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {25180#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~4#1;havoc is_transmit4_triggered_~__retres1~4#1; {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {25180#true} assume !(1 == ~t4_pc~0); {25180#true} is VALID [2022-02-20 19:27:45,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {25180#true} is_transmit4_triggered_~__retres1~4#1 := 0; {25180#true} is VALID [2022-02-20 19:27:45,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {25180#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~4#1; {25180#true} is VALID [2022-02-20 19:27:45,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {25180#true} #t~ret38#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret38#1 && #t~ret38#1 <= 2147483647;~tmp___3~0#1 := #t~ret38#1;havoc #t~ret38#1; {25180#true} is VALID [2022-02-20 19:27:45,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {25180#true} assume !(0 != ~tmp___3~0#1); {25180#true} is VALID [2022-02-20 19:27:45,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,207 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25180#true} {25181#false} #10808#return; {25181#false} is VALID [2022-02-20 19:27:45,207 INFO L272 TraceCheckUtils]: 60: Hoare triple {25181#false} call reset_delta_events(); {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {25246#(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) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {25180#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {25180#true} assume !(1 == ~T2_E~0); {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {25180#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {25180#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {25180#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {25180#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {25180#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {25180#true} assume 1 == ~E_3~0;~E_3~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {25180#true} assume 1 == ~E_4~0;~E_4~0 := 2; {25180#true} is VALID [2022-02-20 19:27:45,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,209 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25180#true} {25181#false} #10810#return; {25181#false} is VALID [2022-02-20 19:27:45,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {25181#false} assume !false; {25181#false} is VALID [2022-02-20 19:27:45,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {25181#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_5~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {25181#false} is VALID [2022-02-20 19:27:45,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {25181#false} assume !false; {25181#false} is VALID [2022-02-20 19:27:45,210 INFO L272 TraceCheckUtils]: 76: Hoare triple {25181#false} call eval_#t~ret28#1 := exists_runnable_thread(); {25180#true} is VALID [2022-02-20 19:27:45,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {25180#true} havoc ~__retres1~5; {25180#true} is VALID [2022-02-20 19:27:45,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {25180#true} assume 0 == ~m_st~0;~__retres1~5 := 1; {25180#true} is VALID [2022-02-20 19:27:45,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {25180#true} #res := ~__retres1~5; {25180#true} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {25180#true} assume true; {25180#true} is VALID [2022-02-20 19:27:45,211 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25180#true} {25181#false} #10812#return; {25181#false} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {25181#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {25181#false} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {25181#false} assume 0 != eval_~tmp~0#1; {25181#false} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {25181#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {25181#false} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {25181#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {25181#false} is VALID [2022-02-20 19:27:45,211 INFO L290 TraceCheckUtils]: 86: Hoare triple {25181#false} assume !(0 == ~m_pc~0); {25181#false} is VALID [2022-02-20 19:27:45,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {25181#false} assume 1 == ~m_pc~0; {25181#false} is VALID [2022-02-20 19:27:45,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {25181#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error } true; {25181#false} is VALID [2022-02-20 19:27:45,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {25181#false} assume !false; {25181#false} is VALID [2022-02-20 19:27:45,212 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:27:45,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:45,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015373975] [2022-02-20 19:27:45,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015373975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:45,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:45,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:27:45,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189870542] [2022-02-20 19:27:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2022-02-20 19:27:45,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:45,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:27:45,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:45,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:27:45,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:45,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:27:45,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:27:45,280 INFO L87 Difference]: Start difference. First operand 2466 states and 4481 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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)