./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:20:30,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:20:30,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:20:30,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:20:30,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:20:30,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:20:30,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:20:30,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:20:30,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:20:30,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:20:30,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:20:30,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:20:30,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:20:30,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:20:30,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:20:30,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:20:30,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:20:30,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:20:30,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:20:30,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:20:30,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:20:30,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:20:30,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:20:30,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:20:30,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:20:30,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:20:30,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:20:30,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:20:30,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:20:30,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:20:30,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:20:30,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:20:30,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:20:30,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:20:30,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:20:30,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:20:30,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:20:30,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:20:30,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:20:30,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:20:30,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:20:30,154 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:20:30,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:20:30,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:20:30,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:20:30,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:20:30,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:20:30,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:20:30,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:20:30,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:20:30,181 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:20:30,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:20:30,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:20:30,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:20:30,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:20:30,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:20:30,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:20:30,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:20:30,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:20:30,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:20:30,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:20:30,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:20:30,185 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:20:30,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:20:30,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:20:30,185 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 -> 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f [2022-02-20 19:20:30,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:20:30,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:20:30,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:20:30,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:20:30,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:20:30,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2022-02-20 19:20:30,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed79a4e8/1496f3652fa74680aa0f4a85e1b2fa17/FLAG8b33b5b84 [2022-02-20 19:20:31,087 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:20:31,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2022-02-20 19:20:31,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed79a4e8/1496f3652fa74680aa0f4a85e1b2fa17/FLAG8b33b5b84 [2022-02-20 19:20:31,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed79a4e8/1496f3652fa74680aa0f4a85e1b2fa17 [2022-02-20 19:20:31,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:20:31,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:20:31,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:20:31,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:20:31,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:20:31,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:20:31" (1/1) ... [2022-02-20 19:20:31,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f835f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:31, skipping insertion in model container [2022-02-20 19:20:31,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:20:31" (1/1) ... [2022-02-20 19:20:31,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:20:31,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:20:32,561 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_label45+token_ring.03.cil-2.c[380323,380336] [2022-02-20 19:20:32,576 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_label45+token_ring.03.cil-2.c[383339,383352] [2022-02-20 19:20:32,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:20:32,676 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:20:33,358 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_label45+token_ring.03.cil-2.c[380323,380336] [2022-02-20 19:20:33,365 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_label45+token_ring.03.cil-2.c[383339,383352] [2022-02-20 19:20:33,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:20:33,418 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:20:33,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33 WrapperNode [2022-02-20 19:20:33,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:20:33,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:20:33,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:20:33,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:20:33,424 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:20:33" (1/1) ... [2022-02-20 19:20:33,504 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:20:33" (1/1) ... [2022-02-20 19:20:34,084 INFO L137 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12677 [2022-02-20 19:20:34,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:20:34,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:20:34,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:20:34,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:20:34,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:20:34,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:20:34,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:20:34,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:20:34,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (1/1) ... [2022-02-20 19:20:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:20:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:20:34,460 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:20:34,475 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:20:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:20:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:20:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:20:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:20:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:20:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:20:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:20:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:20:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:20:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:20:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:20:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:20:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:20:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:20:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:20:34,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:20:34,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:20:34,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:20:39,405 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:20:39,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:20:39,460 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 19:20:39,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:20:39 BoogieIcfgContainer [2022-02-20 19:20:39,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:20:39,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:20:39,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:20:39,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:20:39,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:20:31" (1/3) ... [2022-02-20 19:20:39,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635a0e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:20:39, skipping insertion in model container [2022-02-20 19:20:39,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:33" (2/3) ... [2022-02-20 19:20:39,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635a0e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:20:39, skipping insertion in model container [2022-02-20 19:20:39,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:20:39" (3/3) ... [2022-02-20 19:20:39,487 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-2.c [2022-02-20 19:20:39,490 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:20:39,497 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:20:39,574 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:20:39,601 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:20:39,601 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:20:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 2340 states, 2314 states have (on average 1.8556611927398445) internal successors, (4294), 2317 states have internal predecessors, (4294), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 19:20:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:20:39,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:20:39,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:20:39,663 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:20:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:20:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 200056068, now seen corresponding path program 1 times [2022-02-20 19:20:39,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:20:39,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980837847] [2022-02-20 19:20:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:20:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:20:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:20:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,872 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2343#true} {2345#(= ~M_E~0 2)} #10692#return; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:20:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume true; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,916 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2400#(= |old(~M_E~0)| 0)} {2345#(= ~M_E~0 2)} #10694#return; {2344#false} is VALID [2022-02-20 19:20:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:20:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {2343#true} is VALID [2022-02-20 19:20:39,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2343#true} assume 1 == ~m_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {2343#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {2343#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2343#true} is VALID [2022-02-20 19:20:39,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {2343#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {2343#true} is VALID [2022-02-20 19:20:39,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2343#true} assume !(1 == ~t1_pc~0); {2343#true} is VALID [2022-02-20 19:20:39,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2343#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2343#true} is VALID [2022-02-20 19:20:39,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {2343#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2343#true} is VALID [2022-02-20 19:20:39,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {2343#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {2343#true} is VALID [2022-02-20 19:20:39,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#true} assume 1 == ~t2_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2343#true} is VALID [2022-02-20 19:20:39,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {2343#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {2343#true} is VALID [2022-02-20 19:20:39,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {2343#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {2343#true} assume 1 == ~t3_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {2343#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {2343#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2343#true} is VALID [2022-02-20 19:20:39,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {2343#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {2343#true} is VALID [2022-02-20 19:20:39,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {2343#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,953 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2343#true} {2344#false} #10696#return; {2344#false} is VALID [2022-02-20 19:20:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:20:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2343#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2343#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {2343#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {2343#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {2343#true} assume !(1 == ~E_2~0); {2343#true} is VALID [2022-02-20 19:20:39,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {2343#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,970 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2343#true} {2344#false} #10698#return; {2344#false} is VALID [2022-02-20 19:20:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:20:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:39,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {2343#true} havoc ~__retres1~4; {2343#true} is VALID [2022-02-20 19:20:39,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {2343#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2343#true} is VALID [2022-02-20 19:20:39,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {2343#true} #res := ~__retres1~4; {2343#true} is VALID [2022-02-20 19:20:39,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,976 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2343#true} {2344#false} #10700#return; {2344#false} is VALID [2022-02-20 19:20:39,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {2343#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2345#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {2345#(= ~M_E~0 2)} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {2345#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#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; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {2345#(= ~M_E~0 2)} call update_channels(); {2343#true} is VALID [2022-02-20 19:20:39,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,979 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2343#true} {2345#(= ~M_E~0 2)} #10692#return; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {2345#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {2345#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {2345#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {2345#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {2345#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {2345#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2345#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:39,982 INFO L272 TraceCheckUtils]: 13: Hoare triple {2345#(= ~M_E~0 2)} call fire_delta_events(); {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:39,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {2400#(= |old(~M_E~0)| 0)} assume true; {2400#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:39,986 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2400#(= |old(~M_E~0)| 0)} {2345#(= ~M_E~0 2)} #10694#return; {2344#false} is VALID [2022-02-20 19:20:39,986 INFO L272 TraceCheckUtils]: 24: Hoare triple {2344#false} call activate_threads(); {2401#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:20:39,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {2401#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {2343#true} assume 1 == ~m_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {2343#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {2343#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {2343#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {2343#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {2343#true} assume !(1 == ~t1_pc~0); {2343#true} is VALID [2022-02-20 19:20:39,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {2343#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2343#true} is VALID [2022-02-20 19:20:39,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {2343#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2343#true} is VALID [2022-02-20 19:20:39,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {2343#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {2343#true} is VALID [2022-02-20 19:20:39,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {2343#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {2343#true} assume 1 == ~t2_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {2343#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {2343#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {2343#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {2343#true} is VALID [2022-02-20 19:20:39,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {2343#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {2343#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; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {2343#true} assume 1 == ~t3_pc~0; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {2343#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {2343#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {2343#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {2343#true} is VALID [2022-02-20 19:20:39,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {2343#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2343#true} is VALID [2022-02-20 19:20:39,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,991 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2343#true} {2344#false} #10696#return; {2344#false} is VALID [2022-02-20 19:20:39,991 INFO L272 TraceCheckUtils]: 51: Hoare triple {2344#false} call reset_delta_events(); {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:39,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {2399#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {2343#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {2343#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {2343#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {2343#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {2343#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {2343#true} assume !(1 == ~E_2~0); {2343#true} is VALID [2022-02-20 19:20:39,992 INFO L290 TraceCheckUtils]: 59: Hoare triple {2343#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2343#true} is VALID [2022-02-20 19:20:39,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,993 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2343#true} {2344#false} #10698#return; {2344#false} is VALID [2022-02-20 19:20:39,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:20:39,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {2344#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_~tmp~0#1;havoc eval_~tmp~0#1; {2344#false} is VALID [2022-02-20 19:20:39,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:20:39,993 INFO L272 TraceCheckUtils]: 65: Hoare triple {2344#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2343#true} is VALID [2022-02-20 19:20:39,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {2343#true} havoc ~__retres1~4; {2343#true} is VALID [2022-02-20 19:20:39,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {2343#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2343#true} is VALID [2022-02-20 19:20:39,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {2343#true} #res := ~__retres1~4; {2343#true} is VALID [2022-02-20 19:20:39,994 INFO L290 TraceCheckUtils]: 69: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:20:39,994 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2343#true} {2344#false} #10700#return; {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {2344#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; {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {2344#false} assume 0 != eval_~tmp~0#1; {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {2344#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; {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 74: Hoare triple {2344#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 75: Hoare triple {2344#false} assume !(0 == ~m_pc~0); {2344#false} is VALID [2022-02-20 19:20:39,995 INFO L290 TraceCheckUtils]: 76: Hoare triple {2344#false} assume 1 == ~m_pc~0; {2344#false} is VALID [2022-02-20 19:20:39,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {2344#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error } true; {2344#false} is VALID [2022-02-20 19:20:39,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:20:39,997 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:20:39,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:20:39,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980837847] [2022-02-20 19:20:39,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980837847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:20:39,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:20:39,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:20:39,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049767146] [2022-02-20 19:20:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:20:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:20:40,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:20:40,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:40,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:40,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:20:40,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:20:40,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:20:40,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:20:40,086 INFO L87 Difference]: Start difference. First operand has 2340 states, 2314 states have (on average 1.8556611927398445) internal successors, (4294), 2317 states have internal predecessors, (4294), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:50,821 INFO L93 Difference]: Finished difference Result 4899 states and 9012 transitions. [2022-02-20 19:20:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:20:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:20:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:20:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9012 transitions. [2022-02-20 19:20:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9012 transitions. [2022-02-20 19:20:50,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 9012 transitions. [2022-02-20 19:20:56,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9012 edges. 9012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:56,940 INFO L225 Difference]: With dead ends: 4899 [2022-02-20 19:20:56,941 INFO L226 Difference]: Without dead ends: 2500 [2022-02-20 19:20:56,947 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:20:56,950 INFO L933 BasicCegarLoop]: 4287 mSDtfsCounter, 4543 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 16755 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:20:56,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4553 Valid, 16755 Invalid, 782 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:20:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2022-02-20 19:20:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2415. [2022-02-20 19:20:57,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:20:57,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2500 states. Second operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:57,068 INFO L74 IsIncluded]: Start isIncluded. First operand 2500 states. Second operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:57,075 INFO L87 Difference]: Start difference. First operand 2500 states. Second operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:57,246 INFO L93 Difference]: Finished difference Result 2500 states and 4536 transitions. [2022-02-20 19:20:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4536 transitions. [2022-02-20 19:20:57,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:20:57,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:20:57,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) Second operand 2500 states. [2022-02-20 19:20:57,266 INFO L87 Difference]: Start difference. First operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) Second operand 2500 states. [2022-02-20 19:20:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:57,432 INFO L93 Difference]: Finished difference Result 2500 states and 4536 transitions. [2022-02-20 19:20:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4536 transitions. [2022-02-20 19:20:57,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:20:57,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:20:57,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:20:57,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:20:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2371 states have (on average 1.8291859974694222) internal successors, (4337), 2374 states have internal predecessors, (4337), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4398 transitions. [2022-02-20 19:20:57,612 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4398 transitions. Word has length 79 [2022-02-20 19:20:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:20:57,613 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4398 transitions. [2022-02-20 19:20:57,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4398 transitions. [2022-02-20 19:20:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:20:57,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:20:57,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:20:57,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:20:57,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:20:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:20:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 437104264, now seen corresponding path program 1 times [2022-02-20 19:20:57,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:20:57,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15712336] [2022-02-20 19:20:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:20:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:20:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:20:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,685 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15020#true} {15022#(= ~T1_E~0 ~M_E~0)} #10692#return; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:20:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {15077#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:20:57,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {15077#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,735 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {15022#(= ~T1_E~0 ~M_E~0)} #10694#return; {15021#false} is VALID [2022-02-20 19:20:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:20:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {15079#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {15020#true} is VALID [2022-02-20 19:20:57,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {15020#true} assume 1 == ~m_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {15020#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {15020#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {15020#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {15020#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {15020#true} assume !(1 == ~t1_pc~0); {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {15020#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15020#true} is VALID [2022-02-20 19:20:57,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {15020#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {15020#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {15020#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {15020#true} assume 1 == ~t2_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {15020#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {15020#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {15020#true} is VALID [2022-02-20 19:20:57,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {15020#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {15020#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {15020#true} assume 1 == ~t3_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {15020#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {15020#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {15020#true} is VALID [2022-02-20 19:20:57,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {15020#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {15020#true} is VALID [2022-02-20 19:20:57,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {15020#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,778 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15020#true} {15021#false} #10696#return; {15021#false} is VALID [2022-02-20 19:20:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:20:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {15020#true} is VALID [2022-02-20 19:20:57,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {15020#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {15020#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {15020#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {15020#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {15020#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {15020#true} assume !(1 == ~E_2~0); {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {15020#true} assume 1 == ~E_3~0;~E_3~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,792 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15020#true} {15021#false} #10698#return; {15021#false} is VALID [2022-02-20 19:20:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:20:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:57,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {15020#true} havoc ~__retres1~4; {15020#true} is VALID [2022-02-20 19:20:57,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {15020#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15020#true} is VALID [2022-02-20 19:20:57,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {15020#true} #res := ~__retres1~4; {15020#true} is VALID [2022-02-20 19:20:57,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,799 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15020#true} {15021#false} #10700#return; {15021#false} is VALID [2022-02-20 19:20:57,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {15020#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#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; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} call update_channels(); {15020#true} is VALID [2022-02-20 19:20:57,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,802 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15020#true} {15022#(= ~T1_E~0 ~M_E~0)} #10692#return; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {15022#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:57,805 INFO L272 TraceCheckUtils]: 13: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:57,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {15077#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:20:57,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {15077#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:57,811 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15078#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {15022#(= ~T1_E~0 ~M_E~0)} #10694#return; {15021#false} is VALID [2022-02-20 19:20:57,811 INFO L272 TraceCheckUtils]: 24: Hoare triple {15021#false} call activate_threads(); {15079#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:20:57,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {15079#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {15020#true} is VALID [2022-02-20 19:20:57,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {15020#true} assume 1 == ~m_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {15020#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {15020#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {15020#true} is VALID [2022-02-20 19:20:57,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {15020#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {15020#true} is VALID [2022-02-20 19:20:57,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {15020#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {15020#true} assume !(1 == ~t1_pc~0); {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {15020#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {15020#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {15020#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {15020#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {15020#true} assume 1 == ~t2_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {15020#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {15020#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {15020#true} is VALID [2022-02-20 19:20:57,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {15020#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {15020#true} is VALID [2022-02-20 19:20:57,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {15020#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {15020#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; {15020#true} is VALID [2022-02-20 19:20:57,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {15020#true} assume 1 == ~t3_pc~0; {15020#true} is VALID [2022-02-20 19:20:57,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {15020#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {15020#true} is VALID [2022-02-20 19:20:57,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {15020#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {15020#true} is VALID [2022-02-20 19:20:57,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {15020#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {15020#true} is VALID [2022-02-20 19:20:57,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {15020#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {15020#true} is VALID [2022-02-20 19:20:57,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,819 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15020#true} {15021#false} #10696#return; {15021#false} is VALID [2022-02-20 19:20:57,819 INFO L272 TraceCheckUtils]: 51: Hoare triple {15021#false} call reset_delta_events(); {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:57,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {15076#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {15020#true} is VALID [2022-02-20 19:20:57,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {15020#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {15020#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {15020#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {15020#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {15020#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {15020#true} assume !(1 == ~E_2~0); {15020#true} is VALID [2022-02-20 19:20:57,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {15020#true} assume 1 == ~E_3~0;~E_3~0 := 2; {15020#true} is VALID [2022-02-20 19:20:57,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,824 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {15020#true} {15021#false} #10698#return; {15021#false} is VALID [2022-02-20 19:20:57,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:20:57,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {15021#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_~tmp~0#1;havoc eval_~tmp~0#1; {15021#false} is VALID [2022-02-20 19:20:57,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:20:57,830 INFO L272 TraceCheckUtils]: 65: Hoare triple {15021#false} call eval_#t~ret28#1 := exists_runnable_thread(); {15020#true} is VALID [2022-02-20 19:20:57,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {15020#true} havoc ~__retres1~4; {15020#true} is VALID [2022-02-20 19:20:57,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {15020#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15020#true} is VALID [2022-02-20 19:20:57,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {15020#true} #res := ~__retres1~4; {15020#true} is VALID [2022-02-20 19:20:57,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:20:57,831 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15020#true} {15021#false} #10700#return; {15021#false} is VALID [2022-02-20 19:20:57,833 INFO L290 TraceCheckUtils]: 71: Hoare triple {15021#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; {15021#false} is VALID [2022-02-20 19:20:57,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {15021#false} assume 0 != eval_~tmp~0#1; {15021#false} is VALID [2022-02-20 19:20:57,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {15021#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; {15021#false} is VALID [2022-02-20 19:20:57,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {15021#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {15021#false} is VALID [2022-02-20 19:20:57,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {15021#false} assume !(0 == ~m_pc~0); {15021#false} is VALID [2022-02-20 19:20:57,834 INFO L290 TraceCheckUtils]: 76: Hoare triple {15021#false} assume 1 == ~m_pc~0; {15021#false} is VALID [2022-02-20 19:20:57,834 INFO L290 TraceCheckUtils]: 77: Hoare triple {15021#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error } true; {15021#false} is VALID [2022-02-20 19:20:57,834 INFO L290 TraceCheckUtils]: 78: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:20:57,835 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:20:57,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:20:57,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15712336] [2022-02-20 19:20:57,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15712336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:20:57,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:20:57,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:20:57,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247823660] [2022-02-20 19:20:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:20:57,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:20:57,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:20:57,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:57,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:57,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:20:57,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:20:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:20:57,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:20:57,893 INFO L87 Difference]: Start difference. First operand 2415 states and 4398 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:09,605 INFO L93 Difference]: Finished difference Result 2969 states and 5244 transitions. [2022-02-20 19:21:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:21:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:21:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:21:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4755 transitions. [2022-02-20 19:21:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4755 transitions. [2022-02-20 19:21:09,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4755 transitions. [2022-02-20 19:21:12,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4755 edges. 4755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:13,138 INFO L225 Difference]: With dead ends: 2969 [2022-02-20 19:21:13,138 INFO L226 Difference]: Without dead ends: 2686 [2022-02-20 19:21:13,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:21:13,140 INFO L933 BasicCegarLoop]: 4320 mSDtfsCounter, 4469 mSDsluCounter, 16555 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 20875 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:21:13,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4479 Valid, 20875 Invalid, 1147 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:21:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-02-20 19:21:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2548. [2022-02-20 19:21:13,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:21:13,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2686 states. Second operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:13,227 INFO L74 IsIncluded]: Start isIncluded. First operand 2686 states. Second operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:13,233 INFO L87 Difference]: Start difference. First operand 2686 states. Second operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:13,418 INFO L93 Difference]: Finished difference Result 2686 states and 4818 transitions. [2022-02-20 19:21:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4818 transitions. [2022-02-20 19:21:13,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:13,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:13,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 2686 states. [2022-02-20 19:21:13,437 INFO L87 Difference]: Start difference. First operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 2686 states. [2022-02-20 19:21:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:13,622 INFO L93 Difference]: Finished difference Result 2686 states and 4818 transitions. [2022-02-20 19:21:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4818 transitions. [2022-02-20 19:21:13,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:13,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:13,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:21:13,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:21:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2485 states have (on average 1.8132796780684104) internal successors, (4506), 2489 states have internal predecessors, (4506), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4593 transitions. [2022-02-20 19:21:13,816 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4593 transitions. Word has length 79 [2022-02-20 19:21:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:21:13,816 INFO L470 AbstractCegarLoop]: Abstraction has 2548 states and 4593 transitions. [2022-02-20 19:21:13,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4593 transitions. [2022-02-20 19:21:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:21:13,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:21:13,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:21:13,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:21:13,818 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:21:13,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:21:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash 382711366, now seen corresponding path program 1 times [2022-02-20 19:21:13,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:21:13,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446888111] [2022-02-20 19:21:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:21:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:21:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:21:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,869 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26400#true} {26402#(= ~T2_E~0 ~M_E~0)} #10692#return; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:21:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:13,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:13,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,912 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {26402#(= ~T2_E~0 ~M_E~0)} #10694#return; {26401#false} is VALID [2022-02-20 19:21:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:21:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {26459#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {26400#true} is VALID [2022-02-20 19:21:13,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {26400#true} assume 1 == ~m_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {26400#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {26400#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {26400#true} is VALID [2022-02-20 19:21:13,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {26400#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {26400#true} is VALID [2022-02-20 19:21:13,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {26400#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {26400#true} assume !(1 == ~t1_pc~0); {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {26400#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {26400#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {26400#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {26400#true} assume 1 == ~t2_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {26400#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {26400#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {26400#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {26400#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {26400#true} assume 1 == ~t3_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {26400#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {26400#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {26400#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {26400#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,939 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26400#true} {26401#false} #10696#return; {26401#false} is VALID [2022-02-20 19:21:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:21:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {26400#true} is VALID [2022-02-20 19:21:13,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {26400#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {26400#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {26400#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {26400#true} assume 1 == ~E_M~0;~E_M~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {26400#true} assume 1 == ~E_1~0;~E_1~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {26400#true} assume !(1 == ~E_2~0); {26400#true} is VALID [2022-02-20 19:21:13,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {26400#true} assume 1 == ~E_3~0;~E_3~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,952 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26400#true} {26401#false} #10698#return; {26401#false} is VALID [2022-02-20 19:21:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:21:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:13,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {26400#true} havoc ~__retres1~4; {26400#true} is VALID [2022-02-20 19:21:13,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {26400#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26400#true} is VALID [2022-02-20 19:21:13,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {26400#true} #res := ~__retres1~4; {26400#true} is VALID [2022-02-20 19:21:13,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,959 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26400#true} {26401#false} #10700#return; {26401#false} is VALID [2022-02-20 19:21:13,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {26400#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#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; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} call update_channels(); {26400#true} is VALID [2022-02-20 19:21:13,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,962 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26400#true} {26402#(= ~T2_E~0 ~M_E~0)} #10692#return; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {26402#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:13,965 INFO L272 TraceCheckUtils]: 13: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:13,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:13,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:13,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {26457#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:13,973 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26458#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {26402#(= ~T2_E~0 ~M_E~0)} #10694#return; {26401#false} is VALID [2022-02-20 19:21:13,973 INFO L272 TraceCheckUtils]: 24: Hoare triple {26401#false} call activate_threads(); {26459#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:21:13,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {26459#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {26400#true} is VALID [2022-02-20 19:21:13,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {26400#true} assume 1 == ~m_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {26400#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {26400#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {26400#true} is VALID [2022-02-20 19:21:13,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {26400#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {26400#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {26400#true} assume !(1 == ~t1_pc~0); {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {26400#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {26400#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {26400#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {26400#true} is VALID [2022-02-20 19:21:13,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {26400#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {26400#true} assume 1 == ~t2_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {26400#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {26400#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {26400#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {26400#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {26400#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; {26400#true} is VALID [2022-02-20 19:21:13,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {26400#true} assume 1 == ~t3_pc~0; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {26400#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {26400#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {26400#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {26400#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,976 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26400#true} {26401#false} #10696#return; {26401#false} is VALID [2022-02-20 19:21:13,976 INFO L272 TraceCheckUtils]: 51: Hoare triple {26401#false} call reset_delta_events(); {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:13,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {26456#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {26400#true} is VALID [2022-02-20 19:21:13,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {26400#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {26400#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {26400#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {26400#true} assume 1 == ~E_M~0;~E_M~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {26400#true} assume 1 == ~E_1~0;~E_1~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {26400#true} assume !(1 == ~E_2~0); {26400#true} is VALID [2022-02-20 19:21:13,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {26400#true} assume 1 == ~E_3~0;~E_3~0 := 2; {26400#true} is VALID [2022-02-20 19:21:13,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,982 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {26400#true} {26401#false} #10698#return; {26401#false} is VALID [2022-02-20 19:21:13,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:21:13,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {26401#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_~tmp~0#1;havoc eval_~tmp~0#1; {26401#false} is VALID [2022-02-20 19:21:13,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:21:13,982 INFO L272 TraceCheckUtils]: 65: Hoare triple {26401#false} call eval_#t~ret28#1 := exists_runnable_thread(); {26400#true} is VALID [2022-02-20 19:21:13,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {26400#true} havoc ~__retres1~4; {26400#true} is VALID [2022-02-20 19:21:13,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {26400#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26400#true} is VALID [2022-02-20 19:21:13,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {26400#true} #res := ~__retres1~4; {26400#true} is VALID [2022-02-20 19:21:13,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:21:13,984 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {26400#true} {26401#false} #10700#return; {26401#false} is VALID [2022-02-20 19:21:13,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {26401#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; {26401#false} is VALID [2022-02-20 19:21:13,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {26401#false} assume 0 != eval_~tmp~0#1; {26401#false} is VALID [2022-02-20 19:21:13,985 INFO L290 TraceCheckUtils]: 73: Hoare triple {26401#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; {26401#false} is VALID [2022-02-20 19:21:13,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {26401#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {26401#false} is VALID [2022-02-20 19:21:13,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {26401#false} assume !(0 == ~m_pc~0); {26401#false} is VALID [2022-02-20 19:21:13,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {26401#false} assume 1 == ~m_pc~0; {26401#false} is VALID [2022-02-20 19:21:13,986 INFO L290 TraceCheckUtils]: 77: Hoare triple {26401#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error } true; {26401#false} is VALID [2022-02-20 19:21:13,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:21:13,987 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:21:13,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:21:13,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446888111] [2022-02-20 19:21:13,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446888111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:21:13,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:21:13,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:21:13,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042747028] [2022-02-20 19:21:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:21:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:21:13,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:21:13,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:14,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:14,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:21:14,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:21:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:21:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:21:14,039 INFO L87 Difference]: Start difference. First operand 2548 states and 4593 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:26,030 INFO L93 Difference]: Finished difference Result 3451 states and 5967 transitions. [2022-02-20 19:21:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:21:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:21:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:21:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4760 transitions. [2022-02-20 19:21:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4760 transitions. [2022-02-20 19:21:26,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4760 transitions. [2022-02-20 19:21:28,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4760 edges. 4760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:28,652 INFO L225 Difference]: With dead ends: 3451 [2022-02-20 19:21:28,653 INFO L226 Difference]: Without dead ends: 3035 [2022-02-20 19:21:28,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:21:28,655 INFO L933 BasicCegarLoop]: 4312 mSDtfsCounter, 4466 mSDsluCounter, 16555 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 20867 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:21:28,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4476 Valid, 20867 Invalid, 1152 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:21:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2022-02-20 19:21:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2815. [2022-02-20 19:21:28,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:21:28,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3035 states. Second operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:28,715 INFO L74 IsIncluded]: Start isIncluded. First operand 3035 states. Second operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:28,720 INFO L87 Difference]: Start difference. First operand 3035 states. Second operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:28,952 INFO L93 Difference]: Finished difference Result 3035 states and 5343 transitions. [2022-02-20 19:21:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 5343 transitions. [2022-02-20 19:21:28,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:28,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:28,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 3035 states. [2022-02-20 19:21:28,967 INFO L87 Difference]: Start difference. First operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 3035 states. [2022-02-20 19:21:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:29,197 INFO L93 Difference]: Finished difference Result 3035 states and 5343 transitions. [2022-02-20 19:21:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 5343 transitions. [2022-02-20 19:21:29,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:29,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:29,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:21:29,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:21:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2714 states have (on average 1.7851879145173175) internal successors, (4845), 2720 states have internal predecessors, (4845), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4988 transitions. [2022-02-20 19:21:29,441 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4988 transitions. Word has length 79 [2022-02-20 19:21:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:21:29,441 INFO L470 AbstractCegarLoop]: Abstraction has 2815 states and 4988 transitions. [2022-02-20 19:21:29,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4988 transitions. [2022-02-20 19:21:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:21:29,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:21:29,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:21:29,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:21:29,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:21:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:21:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash -34685240, now seen corresponding path program 1 times [2022-02-20 19:21:29,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:21:29,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788372288] [2022-02-20 19:21:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:21:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:21:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:21:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,479 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {39454#true} {39456#(= ~T3_E~0 ~M_E~0)} #10692#return; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:21:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,511 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {39456#(= ~T3_E~0 ~M_E~0)} #10694#return; {39455#false} is VALID [2022-02-20 19:21:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:21:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {39513#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {39454#true} is VALID [2022-02-20 19:21:29,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {39454#true} assume 1 == ~m_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {39454#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {39454#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39454#true} is VALID [2022-02-20 19:21:29,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {39454#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {39454#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {39454#true} assume !(1 == ~t1_pc~0); {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {39454#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {39454#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {39454#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {39454#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {39454#true} assume 1 == ~t2_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {39454#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {39454#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {39454#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {39454#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {39454#true} assume 1 == ~t3_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {39454#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {39454#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {39454#true} is VALID [2022-02-20 19:21:29,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {39454#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {39454#true} is VALID [2022-02-20 19:21:29,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {39454#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,532 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {39454#true} {39455#false} #10696#return; {39455#false} is VALID [2022-02-20 19:21:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:21:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {39454#true} is VALID [2022-02-20 19:21:29,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {39454#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {39454#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {39454#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {39454#true} assume 1 == ~E_M~0;~E_M~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {39454#true} assume 1 == ~E_1~0;~E_1~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {39454#true} assume !(1 == ~E_2~0); {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {39454#true} assume 1 == ~E_3~0;~E_3~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,538 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {39454#true} {39455#false} #10698#return; {39455#false} is VALID [2022-02-20 19:21:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:21:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:29,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {39454#true} havoc ~__retres1~4; {39454#true} is VALID [2022-02-20 19:21:29,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {39454#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {39454#true} is VALID [2022-02-20 19:21:29,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {39454#true} #res := ~__retres1~4; {39454#true} is VALID [2022-02-20 19:21:29,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,542 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39454#true} {39455#false} #10700#return; {39455#false} is VALID [2022-02-20 19:21:29,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {39454#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume !(0 != main_#t~nondet40#1);havoc main_#t~nondet40#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret38#1, start_simulation_#t~ret39#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; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} call update_channels(); {39454#true} is VALID [2022-02-20 19:21:29,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,544 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39454#true} {39456#(= ~T3_E~0 ~M_E~0)} #10692#return; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {39456#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:29,547 INFO L272 TraceCheckUtils]: 13: Hoare triple {39456#(= ~T3_E~0 ~M_E~0)} call fire_delta_events(); {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {39511#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:29,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39512#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {39456#(= ~T3_E~0 ~M_E~0)} #10694#return; {39455#false} is VALID [2022-02-20 19:21:29,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {39455#false} call activate_threads(); {39513#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:21:29,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {39513#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {39454#true} assume 1 == ~m_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {39454#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {39454#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {39454#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {39454#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {39454#true} assume !(1 == ~t1_pc~0); {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {39454#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39454#true} is VALID [2022-02-20 19:21:29,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {39454#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {39454#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {39454#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {39454#true} assume 1 == ~t2_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {39454#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {39454#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {39454#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {39454#true} is VALID [2022-02-20 19:21:29,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {39454#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {39454#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; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {39454#true} assume 1 == ~t3_pc~0; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {39454#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {39454#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {39454#true} #t~ret36#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___2~0#1 := #t~ret36#1;havoc #t~ret36#1; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {39454#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,553 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {39454#true} {39455#false} #10696#return; {39455#false} is VALID [2022-02-20 19:21:29,554 INFO L272 TraceCheckUtils]: 51: Hoare triple {39455#false} call reset_delta_events(); {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {39510#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {39454#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {39454#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {39454#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {39454#true} assume 1 == ~E_M~0;~E_M~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {39454#true} assume 1 == ~E_1~0;~E_1~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {39454#true} assume !(1 == ~E_2~0); {39454#true} is VALID [2022-02-20 19:21:29,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {39454#true} assume 1 == ~E_3~0;~E_3~0 := 2; {39454#true} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,555 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {39454#true} {39455#false} #10698#return; {39455#false} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {39455#false} assume !false; {39455#false} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {39455#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_~tmp~0#1;havoc eval_~tmp~0#1; {39455#false} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {39455#false} assume !false; {39455#false} is VALID [2022-02-20 19:21:29,555 INFO L272 TraceCheckUtils]: 65: Hoare triple {39455#false} call eval_#t~ret28#1 := exists_runnable_thread(); {39454#true} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {39454#true} havoc ~__retres1~4; {39454#true} is VALID [2022-02-20 19:21:29,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {39454#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {39454#true} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 68: Hoare triple {39454#true} #res := ~__retres1~4; {39454#true} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {39454#true} assume true; {39454#true} is VALID [2022-02-20 19:21:29,556 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {39454#true} {39455#false} #10700#return; {39455#false} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {39455#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; {39455#false} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 72: Hoare triple {39455#false} assume 0 != eval_~tmp~0#1; {39455#false} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 73: Hoare triple {39455#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; {39455#false} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 74: Hoare triple {39455#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {39455#false} is VALID [2022-02-20 19:21:29,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {39455#false} assume !(0 == ~m_pc~0); {39455#false} is VALID [2022-02-20 19:21:29,557 INFO L290 TraceCheckUtils]: 76: Hoare triple {39455#false} assume 1 == ~m_pc~0; {39455#false} is VALID [2022-02-20 19:21:29,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {39455#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error } true; {39455#false} is VALID [2022-02-20 19:21:29,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {39455#false} assume !false; {39455#false} is VALID [2022-02-20 19:21:29,557 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:21:29,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:21:29,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788372288] [2022-02-20 19:21:29,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788372288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:21:29,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:21:29,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:21:29,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609470764] [2022-02-20 19:21:29,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:21:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:21:29,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:21:29,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:29,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:29,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:21:29,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:21:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:21:29,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:21:29,609 INFO L87 Difference]: Start difference. First operand 2815 states and 4988 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:38,880 INFO L93 Difference]: Finished difference Result 4382 states and 7362 transitions. [2022-02-20 19:21:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:21:38,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:21:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:21:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4758 transitions. [2022-02-20 19:21:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4758 transitions. [2022-02-20 19:21:38,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4758 transitions.