./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+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_label41+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 f1e5a0d04cda68be8a659e3f7c3c8d0a5df6c0732a10757201346fc85875f569 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:14:08,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:14:08,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:14:08,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:14:08,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:14:08,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:14:08,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:14:08,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:14:08,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:14:08,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:14:08,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:14:08,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:14:08,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:14:08,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:14:08,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:14:08,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:14:08,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:14:08,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:14:08,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:14:08,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:14:08,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:14:08,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:14:08,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:14:08,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:14:08,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:14:08,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:14:08,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:14:08,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:14:08,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:14:08,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:14:08,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:14:08,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:14:08,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:14:08,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:14:08,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:14:08,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:14:08,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:14:08,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:14:08,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:14:08,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:14:08,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:14:08,909 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:14:08,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:14:08,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:14:08,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:14:08,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:14:08,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:14:08,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:14:08,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:14:08,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:14:08,936 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:14:08,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:14:08,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:14:08,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:14:08,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:14:08,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:14:08,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:14:08,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:14:08,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:14:08,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:14:08,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:14:08,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:14:08,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:14:08,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:14:08,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:14:08,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:14:08,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:14:08,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:14:08,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:14:08,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:14:08,941 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 -> f1e5a0d04cda68be8a659e3f7c3c8d0a5df6c0732a10757201346fc85875f569 [2022-02-20 19:14:09,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:14:09,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:14:09,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:14:09,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:14:09,177 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:14:09,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c [2022-02-20 19:14:09,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238e2f7fd/5ef17fe93cdb41beae0a4a64729b901f/FLAGf658ad76b [2022-02-20 19:14:09,933 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:14:09,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.03.cil-2.c [2022-02-20 19:14:09,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238e2f7fd/5ef17fe93cdb41beae0a4a64729b901f/FLAGf658ad76b [2022-02-20 19:14:10,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238e2f7fd/5ef17fe93cdb41beae0a4a64729b901f [2022-02-20 19:14:10,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:14:10,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:14:10,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:14:10,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:14:10,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:14:10,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:14:10" (1/1) ... [2022-02-20 19:14:10,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c091652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:10, skipping insertion in model container [2022-02-20 19:14:10,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:14:10" (1/1) ... [2022-02-20 19:14:10,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:14:10,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:14:11,598 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_label41+token_ring.03.cil-2.c[376251,376264] [2022-02-20 19:14:11,623 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_label41+token_ring.03.cil-2.c[383339,383352] [2022-02-20 19:14:11,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:14:11,743 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:14:12,376 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_label41+token_ring.03.cil-2.c[376251,376264] [2022-02-20 19:14:12,383 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_label41+token_ring.03.cil-2.c[383339,383352] [2022-02-20 19:14:12,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:14:12,438 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:14:12,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12 WrapperNode [2022-02-20 19:14:12,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:14:12,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:14:12,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:14:12,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:14:12,445 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:14:12" (1/1) ... [2022-02-20 19:14:12,527 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:14:12" (1/1) ... [2022-02-20 19:14:12,915 INFO L137 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12677 [2022-02-20 19:14:12,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:14:12,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:14:12,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:14:12,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:14:12,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:12,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:12,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:12,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:13,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:13,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:13,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:13,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:14:13,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:14:13,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:14:13,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:14:13,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (1/1) ... [2022-02-20 19:14:13,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:14:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:14:13,300 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:14:13,316 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:14:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:14:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:14:13,332 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:14:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:14:13,332 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:14:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:14:13,333 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:14:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:14:13,333 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:14:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:14:13,333 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:14:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:14:13,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:14:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:14:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:14:13,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:14:13,453 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:14:13,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:14:18,747 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:14:18,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:14:18,769 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 19:14:18,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:14:18 BoogieIcfgContainer [2022-02-20 19:14:18,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:14:18,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:14:18,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:14:18,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:14:18,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:14:10" (1/3) ... [2022-02-20 19:14:18,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e2fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:14:18, skipping insertion in model container [2022-02-20 19:14:18,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:14:12" (2/3) ... [2022-02-20 19:14:18,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e2fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:14:18, skipping insertion in model container [2022-02-20 19:14:18,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:14:18" (3/3) ... [2022-02-20 19:14:18,783 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.03.cil-2.c [2022-02-20 19:14:18,786 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:14:18,786 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:14:18,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:14:18,826 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:14:18,826 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:14:18,868 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:14:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:14:18,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:14:18,875 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:14:18,876 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:14:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:14:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 200056068, now seen corresponding path program 1 times [2022-02-20 19:14:18,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:14:18,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586066600] [2022-02-20 19:14:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:14:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:14:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:14:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,094 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:14:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:14:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,137 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:14:19,138 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:14:19,138 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:14:19,138 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:14:19,139 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:14:19,139 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:14:19,139 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:14:19,140 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:14:19,140 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:14:19,141 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:14:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:14:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,164 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:14:19,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {2343#true} assume 1 == ~m_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,165 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:14:19,165 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:14:19,165 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:14:19,166 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:14:19,166 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:14:19,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {2343#true} assume !(1 == ~t1_pc~0); {2343#true} is VALID [2022-02-20 19:14:19,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {2343#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2343#true} is VALID [2022-02-20 19:14:19,167 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:14:19,168 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:14:19,168 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:14:19,168 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:14:19,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#true} assume 1 == ~t2_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,168 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:14:19,169 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:14:19,169 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:14:19,169 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:14:19,169 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:14:19,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {2343#true} assume 1 == ~t3_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,170 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:14:19,170 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:14:19,170 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:14:19,171 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:14:19,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,171 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2343#true} {2344#false} #10696#return; {2344#false} is VALID [2022-02-20 19:14:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:14:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,190 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:14:19,190 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:14:19,190 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:14:19,191 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:14:19,191 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:14:19,191 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:14:19,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {2343#true} assume !(1 == ~E_2~0); {2343#true} is VALID [2022-02-20 19:14:19,192 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:14:19,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,192 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2343#true} {2344#false} #10698#return; {2344#false} is VALID [2022-02-20 19:14:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:14:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:19,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {2343#true} havoc ~__retres1~4; {2343#true} is VALID [2022-02-20 19:14:19,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {2343#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2343#true} is VALID [2022-02-20 19:14:19,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {2343#true} #res := ~__retres1~4; {2343#true} is VALID [2022-02-20 19:14:19,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,201 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2343#true} {2344#false} #10700#return; {2344#false} is VALID [2022-02-20 19:14:19,202 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:14:19,202 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:14:19,203 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:14:19,203 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:14:19,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {2345#(= ~M_E~0 2)} call update_channels(); {2343#true} is VALID [2022-02-20 19:14:19,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,204 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:14:19,204 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:14:19,205 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:14:19,205 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:14:19,205 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:14:19,206 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:14:19,206 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:14:19,207 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:14:19,207 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:14:19,208 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:14:19,208 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:14:19,208 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:14:19,209 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:14:19,209 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:14:19,210 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:14:19,210 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:14:19,210 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:14:19,211 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:14:19,211 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:14:19,215 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:14:19,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {2343#true} assume 1 == ~m_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,216 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:14:19,216 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:14:19,216 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:14:19,216 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:14:19,216 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:14:19,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {2343#true} assume !(1 == ~t1_pc~0); {2343#true} is VALID [2022-02-20 19:14:19,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {2343#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2343#true} is VALID [2022-02-20 19:14:19,217 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:14:19,217 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:14:19,217 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:14:19,218 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:14:19,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {2343#true} assume 1 == ~t2_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,218 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:14:19,218 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:14:19,218 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:14:19,218 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:14:19,219 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:14:19,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {2343#true} assume 1 == ~t3_pc~0; {2343#true} is VALID [2022-02-20 19:14:19,219 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:14:19,219 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:14:19,219 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:14:19,219 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:14:19,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,220 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2343#true} {2344#false} #10696#return; {2344#false} is VALID [2022-02-20 19:14:19,220 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:14:19,220 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:14:19,220 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:14:19,221 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:14:19,221 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:14:19,221 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:14:19,221 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:14:19,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {2343#true} assume !(1 == ~E_2~0); {2343#true} is VALID [2022-02-20 19:14:19,221 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:14:19,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,221 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2343#true} {2344#false} #10698#return; {2344#false} is VALID [2022-02-20 19:14:19,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:14:19,222 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:14:19,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:14:19,222 INFO L272 TraceCheckUtils]: 65: Hoare triple {2344#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2343#true} is VALID [2022-02-20 19:14:19,222 INFO L290 TraceCheckUtils]: 66: Hoare triple {2343#true} havoc ~__retres1~4; {2343#true} is VALID [2022-02-20 19:14:19,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {2343#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2343#true} is VALID [2022-02-20 19:14:19,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {2343#true} #res := ~__retres1~4; {2343#true} is VALID [2022-02-20 19:14:19,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {2343#true} assume true; {2343#true} is VALID [2022-02-20 19:14:19,223 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2343#true} {2344#false} #10700#return; {2344#false} is VALID [2022-02-20 19:14:19,223 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:14:19,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {2344#false} assume 0 != eval_~tmp~0#1; {2344#false} is VALID [2022-02-20 19:14:19,223 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:14:19,223 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:14:19,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {2344#false} assume !(0 == ~m_pc~0); {2344#false} is VALID [2022-02-20 19:14:19,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {2344#false} assume 1 == ~m_pc~0; {2344#false} is VALID [2022-02-20 19:14:19,223 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:14:19,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {2344#false} assume !false; {2344#false} is VALID [2022-02-20 19:14:19,224 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:14:19,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:14:19,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586066600] [2022-02-20 19:14:19,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586066600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:14:19,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:14:19,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:14:19,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742922364] [2022-02-20 19:14:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:14:19,230 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:14:19,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:14:19,239 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:14:19,307 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:14:19,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:14:19,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:14:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:14:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:14:19,334 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:14:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:30,601 INFO L93 Difference]: Finished difference Result 4899 states and 9012 transitions. [2022-02-20 19:14:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:14:30,601 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:14:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:14:30,602 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:14:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9012 transitions. [2022-02-20 19:14:30,657 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:14:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9012 transitions. [2022-02-20 19:14:30,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 9012 transitions. [2022-02-20 19:14:36,748 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:14:37,016 INFO L225 Difference]: With dead ends: 4899 [2022-02-20 19:14:37,017 INFO L226 Difference]: Without dead ends: 2500 [2022-02-20 19:14:37,024 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:14:37,028 INFO L933 BasicCegarLoop]: 4287 mSDtfsCounter, 4543 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:14:37,029 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.8s Time] [2022-02-20 19:14:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2022-02-20 19:14:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2415. [2022-02-20 19:14:37,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:14:37,147 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:14:37,155 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:14:37,160 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:14:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:37,332 INFO L93 Difference]: Finished difference Result 2500 states and 4536 transitions. [2022-02-20 19:14:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4536 transitions. [2022-02-20 19:14:37,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:14:37,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:14:37,349 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:14:37,356 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:14:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:37,558 INFO L93 Difference]: Finished difference Result 2500 states and 4536 transitions. [2022-02-20 19:14:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4536 transitions. [2022-02-20 19:14:37,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:14:37,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:14:37,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:14:37,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:14:37,573 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:14:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4398 transitions. [2022-02-20 19:14:37,756 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4398 transitions. Word has length 79 [2022-02-20 19:14:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:14:37,757 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4398 transitions. [2022-02-20 19:14:37,758 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:14:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4398 transitions. [2022-02-20 19:14:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:14:37,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:14:37,765 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:14:37,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:14:37,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:14:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:14:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash 437104264, now seen corresponding path program 1 times [2022-02-20 19:14:37,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:14:37,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125574973] [2022-02-20 19:14:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:14:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:14:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:14:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,865 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:14:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:14:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,916 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:14:37,916 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:14:37,917 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:14:37,917 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:14:37,917 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:14:37,918 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:14:37,918 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:14:37,918 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:14:37,919 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:14:37,919 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:14:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:14:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,959 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:14:37,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {15020#true} assume 1 == ~m_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,960 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:14:37,960 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:14:37,960 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:14:37,960 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:14:37,960 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:14:37,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {15020#true} assume !(1 == ~t1_pc~0); {15020#true} is VALID [2022-02-20 19:14:37,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {15020#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15020#true} is VALID [2022-02-20 19:14:37,960 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:14:37,960 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:14:37,960 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:14:37,961 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:14:37,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {15020#true} assume 1 == ~t2_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,961 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:14:37,961 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:14:37,961 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:14:37,961 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:14:37,961 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:14:37,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {15020#true} assume 1 == ~t3_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,961 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:14:37,961 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:14:37,962 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:14:37,962 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:14:37,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,962 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15020#true} {15021#false} #10696#return; {15021#false} is VALID [2022-02-20 19:14:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:14:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,969 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:14:37,969 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:14:37,969 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:14:37,969 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:14:37,969 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:14:37,970 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:14:37,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {15020#true} assume !(1 == ~E_2~0); {15020#true} is VALID [2022-02-20 19:14:37,970 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:14:37,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,970 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15020#true} {15021#false} #10698#return; {15021#false} is VALID [2022-02-20 19:14:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:14:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:37,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {15020#true} havoc ~__retres1~4; {15020#true} is VALID [2022-02-20 19:14:37,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {15020#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15020#true} is VALID [2022-02-20 19:14:37,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {15020#true} #res := ~__retres1~4; {15020#true} is VALID [2022-02-20 19:14:37,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,975 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15020#true} {15021#false} #10700#return; {15021#false} is VALID [2022-02-20 19:14:37,977 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:14:37,978 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:14:37,978 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:14:37,978 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:14:37,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {15022#(= ~T1_E~0 ~M_E~0)} call update_channels(); {15020#true} is VALID [2022-02-20 19:14:37,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,979 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:14:37,979 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:14:37,980 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:14:37,980 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:14:37,980 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:14:37,980 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:14:37,981 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:14:37,981 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:14:37,982 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:14:37,983 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:14:37,983 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:14:37,983 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:14:37,984 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:14:37,984 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:14:37,984 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:14:37,985 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:14:37,985 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:14:37,986 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:14:37,986 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:14:37,986 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:14:37,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {15020#true} assume 1 == ~m_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,986 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:14:37,986 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:14:37,986 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:14:37,986 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:14:37,987 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:14:37,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {15020#true} assume !(1 == ~t1_pc~0); {15020#true} is VALID [2022-02-20 19:14:37,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {15020#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15020#true} is VALID [2022-02-20 19:14:37,987 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:14:37,987 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:14:37,987 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:14:37,987 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:14:37,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {15020#true} assume 1 == ~t2_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,988 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:14:37,988 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:14:37,988 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:14:37,988 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:14:37,988 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:14:37,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {15020#true} assume 1 == ~t3_pc~0; {15020#true} is VALID [2022-02-20 19:14:37,989 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:14:37,989 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:14:37,989 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:14:37,989 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:14:37,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,990 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15020#true} {15021#false} #10696#return; {15021#false} is VALID [2022-02-20 19:14:37,990 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:14:37,990 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:14:37,990 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:14:37,991 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:14:37,991 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:14:37,991 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:14:37,991 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:14:37,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {15020#true} assume !(1 == ~E_2~0); {15020#true} is VALID [2022-02-20 19:14:37,992 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:14:37,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,992 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {15020#true} {15021#false} #10698#return; {15021#false} is VALID [2022-02-20 19:14:37,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:14:37,992 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:14:37,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:14:37,993 INFO L272 TraceCheckUtils]: 65: Hoare triple {15021#false} call eval_#t~ret28#1 := exists_runnable_thread(); {15020#true} is VALID [2022-02-20 19:14:37,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {15020#true} havoc ~__retres1~4; {15020#true} is VALID [2022-02-20 19:14:37,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {15020#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15020#true} is VALID [2022-02-20 19:14:37,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {15020#true} #res := ~__retres1~4; {15020#true} is VALID [2022-02-20 19:14:37,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {15020#true} assume true; {15020#true} is VALID [2022-02-20 19:14:37,994 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15020#true} {15021#false} #10700#return; {15021#false} is VALID [2022-02-20 19:14:37,994 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:14:37,994 INFO L290 TraceCheckUtils]: 72: Hoare triple {15021#false} assume 0 != eval_~tmp~0#1; {15021#false} is VALID [2022-02-20 19:14:37,994 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:14:37,994 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:14:37,995 INFO L290 TraceCheckUtils]: 75: Hoare triple {15021#false} assume !(0 == ~m_pc~0); {15021#false} is VALID [2022-02-20 19:14:37,995 INFO L290 TraceCheckUtils]: 76: Hoare triple {15021#false} assume 1 == ~m_pc~0; {15021#false} is VALID [2022-02-20 19:14:37,995 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:14:37,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {15021#false} assume !false; {15021#false} is VALID [2022-02-20 19:14:37,996 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:14:37,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:14:37,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125574973] [2022-02-20 19:14:37,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125574973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:14:37,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:14:37,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:14:37,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144246717] [2022-02-20 19:14:37,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:14:37,998 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:14:37,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:14:37,999 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:14:38,040 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:14:38,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:14:38,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:14:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:14:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:14:38,044 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:14:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:49,848 INFO L93 Difference]: Finished difference Result 2969 states and 5244 transitions. [2022-02-20 19:14:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:14:49,848 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:14:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:14:49,850 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:14:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4755 transitions. [2022-02-20 19:14:49,876 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:14:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4755 transitions. [2022-02-20 19:14:49,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4755 transitions. [2022-02-20 19:14:53,096 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:14:53,303 INFO L225 Difference]: With dead ends: 2969 [2022-02-20 19:14:53,304 INFO L226 Difference]: Without dead ends: 2686 [2022-02-20 19:14:53,305 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:14:53,306 INFO L933 BasicCegarLoop]: 4320 mSDtfsCounter, 4469 mSDsluCounter, 16555 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:14:53,307 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.0s Time] [2022-02-20 19:14:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-02-20 19:14:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2548. [2022-02-20 19:14:53,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:14:53,392 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:14:53,399 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:14:53,404 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:14:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:53,635 INFO L93 Difference]: Finished difference Result 2686 states and 4818 transitions. [2022-02-20 19:14:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4818 transitions. [2022-02-20 19:14:53,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:14:53,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:14:53,643 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:14:53,647 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:14:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:14:53,840 INFO L93 Difference]: Finished difference Result 2686 states and 4818 transitions. [2022-02-20 19:14:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4818 transitions. [2022-02-20 19:14:53,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:14:53,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:14:53,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:14:53,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:14:53,849 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:14:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4593 transitions. [2022-02-20 19:14:54,034 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4593 transitions. Word has length 79 [2022-02-20 19:14:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:14:54,034 INFO L470 AbstractCegarLoop]: Abstraction has 2548 states and 4593 transitions. [2022-02-20 19:14:54,034 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:14:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4593 transitions. [2022-02-20 19:14:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:14:54,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:14:54,035 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:14:54,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:14:54,035 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:14:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:14:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 382711366, now seen corresponding path program 1 times [2022-02-20 19:14:54,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:14:54,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204338670] [2022-02-20 19:14:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:14:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:14:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:14:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,081 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:14:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:14:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,107 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:14:54,108 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:14:54,108 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:14:54,108 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:14:54,109 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:14:54,109 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:14:54,109 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:14:54,110 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:14:54,111 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:14:54,111 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:14:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:14:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,141 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:14:54,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {26400#true} assume 1 == ~m_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,142 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:14:54,142 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:14:54,142 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:14:54,142 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:14:54,142 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:14:54,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {26400#true} assume !(1 == ~t1_pc~0); {26400#true} is VALID [2022-02-20 19:14:54,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26400#true} is VALID [2022-02-20 19:14:54,143 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:14:54,143 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:14:54,143 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:14:54,143 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:14:54,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {26400#true} assume 1 == ~t2_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,143 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:14:54,143 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:14:54,144 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:14:54,144 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:14:54,144 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:14:54,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {26400#true} assume 1 == ~t3_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,144 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:14:54,144 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:14:54,145 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:14:54,145 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:14:54,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,145 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26400#true} {26401#false} #10696#return; {26401#false} is VALID [2022-02-20 19:14:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:14:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,151 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:14:54,151 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:14:54,151 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:14:54,151 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:14:54,152 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:14:54,152 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:14:54,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {26400#true} assume !(1 == ~E_2~0); {26400#true} is VALID [2022-02-20 19:14:54,152 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:14:54,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,152 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26400#true} {26401#false} #10698#return; {26401#false} is VALID [2022-02-20 19:14:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:14:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:14:54,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {26400#true} havoc ~__retres1~4; {26400#true} is VALID [2022-02-20 19:14:54,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {26400#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26400#true} is VALID [2022-02-20 19:14:54,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {26400#true} #res := ~__retres1~4; {26400#true} is VALID [2022-02-20 19:14:54,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,156 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26400#true} {26401#false} #10700#return; {26401#false} is VALID [2022-02-20 19:14:54,157 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:14:54,157 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:14:54,158 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:14:54,158 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:14:54,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {26402#(= ~T2_E~0 ~M_E~0)} call update_channels(); {26400#true} is VALID [2022-02-20 19:14:54,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,159 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:14:54,159 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:14:54,159 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:14:54,160 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:14:54,160 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:14:54,160 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:14:54,160 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:14:54,161 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:14:54,162 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:14:54,162 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:14:54,162 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:14:54,163 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:14:54,163 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:14:54,163 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:14:54,164 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:14:54,164 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:14:54,164 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:14:54,165 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:14:54,165 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:14:54,165 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:14:54,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {26400#true} assume 1 == ~m_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,165 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:14:54,166 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:14:54,166 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:14:54,166 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:14:54,166 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:14:54,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {26400#true} assume !(1 == ~t1_pc~0); {26400#true} is VALID [2022-02-20 19:14:54,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {26400#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26400#true} is VALID [2022-02-20 19:14:54,166 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:14:54,167 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:14:54,167 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:14:54,167 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:14:54,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {26400#true} assume 1 == ~t2_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,167 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:14:54,167 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:14:54,167 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:14:54,167 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:14:54,168 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:14:54,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {26400#true} assume 1 == ~t3_pc~0; {26400#true} is VALID [2022-02-20 19:14:54,168 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:14:54,168 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:14:54,168 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:14:54,168 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:14:54,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,169 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26400#true} {26401#false} #10696#return; {26401#false} is VALID [2022-02-20 19:14:54,169 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:14:54,169 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:14:54,169 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:14:54,169 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:14:54,169 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:14:54,169 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:14:54,170 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:14:54,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {26400#true} assume !(1 == ~E_2~0); {26400#true} is VALID [2022-02-20 19:14:54,170 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:14:54,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,170 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {26400#true} {26401#false} #10698#return; {26401#false} is VALID [2022-02-20 19:14:54,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:14:54,170 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:14:54,171 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:14:54,171 INFO L272 TraceCheckUtils]: 65: Hoare triple {26401#false} call eval_#t~ret28#1 := exists_runnable_thread(); {26400#true} is VALID [2022-02-20 19:14:54,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {26400#true} havoc ~__retres1~4; {26400#true} is VALID [2022-02-20 19:14:54,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {26400#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26400#true} is VALID [2022-02-20 19:14:54,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {26400#true} #res := ~__retres1~4; {26400#true} is VALID [2022-02-20 19:14:54,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {26400#true} assume true; {26400#true} is VALID [2022-02-20 19:14:54,171 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {26400#true} {26401#false} #10700#return; {26401#false} is VALID [2022-02-20 19:14:54,172 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:14:54,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {26401#false} assume 0 != eval_~tmp~0#1; {26401#false} is VALID [2022-02-20 19:14:54,172 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:14:54,172 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:14:54,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {26401#false} assume !(0 == ~m_pc~0); {26401#false} is VALID [2022-02-20 19:14:54,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {26401#false} assume 1 == ~m_pc~0; {26401#false} is VALID [2022-02-20 19:14:54,173 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:14:54,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {26401#false} assume !false; {26401#false} is VALID [2022-02-20 19:14:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:14:54,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:14:54,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204338670] [2022-02-20 19:14:54,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204338670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:14:54,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:14:54,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:14:54,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946650538] [2022-02-20 19:14:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:14:54,179 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:14:54,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:14:54,179 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:14:54,224 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:14:54,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:14:54,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:14:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:14:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:14:54,225 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:15:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:05,744 INFO L93 Difference]: Finished difference Result 3451 states and 5967 transitions. [2022-02-20 19:15:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:15:05,744 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:15:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:15:05,744 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:15:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4760 transitions. [2022-02-20 19:15:05,762 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:15:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4760 transitions. [2022-02-20 19:15:05,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4760 transitions. [2022-02-20 19:15:08,840 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:15:09,137 INFO L225 Difference]: With dead ends: 3451 [2022-02-20 19:15:09,138 INFO L226 Difference]: Without dead ends: 3035 [2022-02-20 19:15:09,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:15:09,140 INFO L933 BasicCegarLoop]: 4312 mSDtfsCounter, 4466 mSDsluCounter, 16555 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:15:09,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4476 Valid, 20867 Invalid, 1152 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:15:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2022-02-20 19:15:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2815. [2022-02-20 19:15:09,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:15:09,188 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:15:09,191 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:15:09,194 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:15:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:09,420 INFO L93 Difference]: Finished difference Result 3035 states and 5343 transitions. [2022-02-20 19:15:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 5343 transitions. [2022-02-20 19:15:09,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:15:09,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:15:09,429 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:15:09,433 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.