./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59598ef74ac7afb6c962e2cc2ba26af488759b7c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:45:12,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:45:12,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:45:12,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:45:12,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:45:12,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:45:12,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:45:12,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:45:12,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:45:12,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:45:12,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:45:12,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:45:12,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:45:12,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:45:12,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:45:12,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:45:12,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:45:12,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:45:12,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:45:12,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:45:12,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:45:12,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:45:12,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:45:12,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:45:12,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:45:12,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:45:12,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:45:12,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:45:12,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:45:12,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:45:12,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:45:12,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:45:12,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:45:12,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:45:12,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:45:12,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:45:12,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:45:12,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:45:12,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:45:12,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:45:12,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:45:12,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:45:12,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:45:12,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:45:12,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:45:12,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:45:12,221 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:45:12,221 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:45:12,221 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:45:12,222 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:45:12,222 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:45:12,222 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:45:12,222 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:45:12,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:45:12,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:45:12,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:45:12,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:45:12,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:45:12,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:45:12,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:45:12,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:45:12,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:45:12,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:45:12,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:45:12,226 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:45:12,226 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:45:12,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:45:12,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:45:12,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:45:12,227 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:45:12,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:45:12,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:45:12,228 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:45:12,229 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:45:12,230 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-11-28 03:45:12,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:45:12,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:45:12,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:45:12,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:45:12,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:45:12,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 03:45:12,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd48e52ea/cefd07e7b1074cd59f69943992aa0d2f/FLAGbc3464840 [2019-11-28 03:45:13,164 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:45:13,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 03:45:13,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd48e52ea/cefd07e7b1074cd59f69943992aa0d2f/FLAGbc3464840 [2019-11-28 03:45:13,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd48e52ea/cefd07e7b1074cd59f69943992aa0d2f [2019-11-28 03:45:13,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:45:13,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:45:13,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:45:13,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:45:13,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:45:13,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6eb3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13, skipping insertion in model container [2019-11-28 03:45:13,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:45:13,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:45:13,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:45:13,773 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:45:13,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:45:13,889 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:45:13,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13 WrapperNode [2019-11-28 03:45:13,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:45:13,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:45:13,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:45:13,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:45:13,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:45:13,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:45:13,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:45:13,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:45:13,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... [2019-11-28 03:45:13,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:45:14,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:45:14,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:45:14,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:45:14,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:45:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:45:14,621 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:45:14,622 INFO L297 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-28 03:45:14,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:14 BoogieIcfgContainer [2019-11-28 03:45:14,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:45:14,627 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:45:14,627 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:45:14,631 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:45:14,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:14,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:45:13" (1/3) ... [2019-11-28 03:45:14,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa6b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:45:14, skipping insertion in model container [2019-11-28 03:45:14,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:14,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:13" (2/3) ... [2019-11-28 03:45:14,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa6b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:45:14, skipping insertion in model container [2019-11-28 03:45:14,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:14,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:14" (3/3) ... [2019-11-28 03:45:14,638 INFO L371 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-28 03:45:14,689 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:45:14,689 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:45:14,689 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:45:14,689 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:45:14,690 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:45:14,691 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:45:14,691 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:45:14,691 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:45:14,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2019-11-28 03:45:14,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2019-11-28 03:45:14,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:14,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:14,792 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:14,792 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:14,793 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:45:14,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2019-11-28 03:45:14,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2019-11-28 03:45:14,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:14,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:14,818 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:14,818 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:14,827 INFO L794 eck$LassoCheckResult]: Stem: 80#ULTIMATE.startENTRYtrue ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 9#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 103#L393true havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 75#L165true assume !(1 == ~m_i~0);~m_st~0 := 2; 25#L172-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 31#L177-1true assume !(0 == ~M_E~0); 115#L261-1true assume !(0 == ~T1_E~0); 129#L266-1true assume !(0 == ~E_M~0); 29#L271-1true assume !(0 == ~E_1~0); 33#L276-1true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 98#L126true assume !(1 == ~m_pc~0); 92#L126-2true is_master_triggered_~__retres1~0 := 0; 99#L137true is_master_triggered_#res := is_master_triggered_~__retres1~0; 70#L138true activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5#L321true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8#L321-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 122#L145true assume 1 == ~t1_pc~0; 61#L146true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 123#L156true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 63#L157true activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10#L329true assume !(0 != activate_threads_~tmp___0~0); 15#L329-2true assume !(1 == ~M_E~0); 81#L289-1true assume !(1 == ~T1_E~0); 84#L294-1true assume !(1 == ~E_M~0); 11#L299-1true assume 1 == ~E_1~0;~E_1~0 := 2; 40#L430-1true [2019-11-28 03:45:14,831 INFO L796 eck$LassoCheckResult]: Loop: 40#L430-1true assume !false; 17#L431true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 138#L236true assume !true; 38#L251true start_simulation_~kernel_st~0 := 2; 82#L165-1true start_simulation_~kernel_st~0 := 3; 110#L261-2true assume 0 == ~M_E~0;~M_E~0 := 1; 107#L261-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 124#L266-3true assume 0 == ~E_M~0;~E_M~0 := 1; 27#L271-3true assume !(0 == ~E_1~0); 32#L276-3true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 104#L126-9true assume 1 == ~m_pc~0; 42#L127-3true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 89#L137-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 43#L138-3true activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 120#L321-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 125#L321-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 97#L145-9true assume 1 == ~t1_pc~0; 53#L146-3true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 147#L156-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 54#L157-3true activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7#L329-9true assume !(0 != activate_threads_~tmp___0~0); 133#L329-11true assume 1 == ~M_E~0;~M_E~0 := 2; 67#L289-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 111#L294-3true assume 1 == ~E_M~0;~E_M~0 := 2; 126#L299-3true assume 1 == ~E_1~0;~E_1~0 := 2; 21#L304-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 64#L190-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 23#L202-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 131#L203-1true start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 62#L449true assume !(0 == start_simulation_~tmp~3); 65#L449-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 60#L190-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 22#L202-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 101#L203-2true stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 102#L404true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 37#L411true stop_simulation_#res := stop_simulation_~__retres2~0; 141#L412true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 87#L462true assume !(0 != start_simulation_~tmp___0~1); 40#L430-1true [2019-11-28 03:45:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2019-11-28 03:45:14,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:14,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803745429] [2019-11-28 03:45:14,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803745429] [2019-11-28 03:45:15,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:45:15,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440450089] [2019-11-28 03:45:15,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:45:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1713125771, now seen corresponding path program 1 times [2019-11-28 03:45:15,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426451859] [2019-11-28 03:45:15,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426451859] [2019-11-28 03:45:15,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:45:15,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697402526] [2019-11-28 03:45:15,028 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:15,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:15,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:15,049 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-28 03:45:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:15,080 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2019-11-28 03:45:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:15,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 218 transitions. [2019-11-28 03:45:15,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2019-11-28 03:45:15,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 140 states and 212 transitions. [2019-11-28 03:45:15,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-11-28 03:45:15,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2019-11-28 03:45:15,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 212 transitions. [2019-11-28 03:45:15,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:45:15,099 INFO L688 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-11-28 03:45:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 212 transitions. [2019-11-28 03:45:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-28 03:45:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 03:45:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2019-11-28 03:45:15,143 INFO L711 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-11-28 03:45:15,143 INFO L591 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-11-28 03:45:15,143 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:45:15,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 212 transitions. [2019-11-28 03:45:15,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2019-11-28 03:45:15,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:15,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:15,148 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:15,148 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:15,148 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 311#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 312#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 414#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 336#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 337#L177-1 assume !(0 == ~M_E~0); 346#L261-1 assume !(0 == ~T1_E~0); 434#L266-1 assume !(0 == ~E_M~0); 343#L271-1 assume !(0 == ~E_1~0); 344#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 348#L126 assume !(1 == ~m_pc~0); 407#L126-2 is_master_triggered_~__retres1~0 := 0; 406#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 408#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 306#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 307#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 310#L145 assume 1 == ~t1_pc~0; 399#L146 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 400#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 402#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 315#L329 assume !(0 != activate_threads_~tmp___0~0); 316#L329-2 assume !(1 == ~M_E~0); 321#L289-1 assume !(1 == ~T1_E~0); 417#L294-1 assume !(1 == ~E_M~0); 317#L299-1 assume 1 == ~E_1~0;~E_1~0 := 2; 318#L430-1 [2019-11-28 03:45:15,149 INFO L796 eck$LassoCheckResult]: Loop: 318#L430-1 assume !false; 323#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 324#L236 assume !false; 350#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 342#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 349#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 433#L217 assume !(0 != eval_~tmp~0); 358#L251 start_simulation_~kernel_st~0 := 2; 359#L165-1 start_simulation_~kernel_st~0 := 3; 418#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 428#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 429#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 339#L271-3 assume !(0 == ~E_1~0); 340#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 347#L126-9 assume 1 == ~m_pc~0; 362#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 363#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 365#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 366#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 437#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 425#L145-9 assume !(1 == ~t1_pc~0); 385#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 384#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 386#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 308#L329-9 assume !(0 != activate_threads_~tmp___0~0); 309#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 403#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 404#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 432#L299-3 assume 1 == ~E_1~0;~E_1~0 := 2; 328#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 329#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 333#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 334#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 397#L449 assume !(0 == start_simulation_~tmp~3); 381#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 395#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 331#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 332#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 426#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 353#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 354#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 421#L462 assume !(0 != start_simulation_~tmp___0~1); 318#L430-1 [2019-11-28 03:45:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2019-11-28 03:45:15,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100467150] [2019-11-28 03:45:15,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100467150] [2019-11-28 03:45:15,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:45:15,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142032977] [2019-11-28 03:45:15,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:45:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash -747579981, now seen corresponding path program 1 times [2019-11-28 03:45:15,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984167309] [2019-11-28 03:45:15,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984167309] [2019-11-28 03:45:15,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:15,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299242157] [2019-11-28 03:45:15,332 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:15,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:15,336 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. cyclomatic complexity: 73 Second operand 3 states. [2019-11-28 03:45:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:15,412 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2019-11-28 03:45:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:15,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 348 transitions. [2019-11-28 03:45:15,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2019-11-28 03:45:15,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 234 states and 348 transitions. [2019-11-28 03:45:15,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2019-11-28 03:45:15,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2019-11-28 03:45:15,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 348 transitions. [2019-11-28 03:45:15,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:45:15,423 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 348 transitions. [2019-11-28 03:45:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 348 transitions. [2019-11-28 03:45:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-11-28 03:45:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 03:45:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2019-11-28 03:45:15,442 INFO L711 BuchiCegarLoop]: Abstraction has 232 states and 346 transitions. [2019-11-28 03:45:15,444 INFO L591 BuchiCegarLoop]: Abstraction has 232 states and 346 transitions. [2019-11-28 03:45:15,444 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:45:15,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 346 transitions. [2019-11-28 03:45:15,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-11-28 03:45:15,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:15,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:15,448 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:15,448 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:15,448 INFO L794 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 694#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 695#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 798#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 719#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 720#L177-1 assume !(0 == ~M_E~0); 730#L261-1 assume !(0 == ~T1_E~0); 826#L266-1 assume !(0 == ~E_M~0); 726#L271-1 assume !(0 == ~E_1~0); 727#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 732#L126 assume !(1 == ~m_pc~0); 791#L126-2 is_master_triggered_~__retres1~0 := 0; 790#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 792#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 689#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 690#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 693#L145 assume !(1 == ~t1_pc~0); 827#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 828#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 785#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 698#L329 assume !(0 != activate_threads_~tmp___0~0); 699#L329-2 assume !(1 == ~M_E~0); 704#L289-1 assume !(1 == ~T1_E~0); 801#L294-1 assume !(1 == ~E_M~0); 700#L299-1 assume 1 == ~E_1~0;~E_1~0 := 2; 701#L430-1 [2019-11-28 03:45:15,449 INFO L796 eck$LassoCheckResult]: Loop: 701#L430-1 assume !false; 706#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 707#L236 assume !false; 735#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 736#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 725#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 874#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 872#L217 assume !(0 != eval_~tmp~0); 740#L251 start_simulation_~kernel_st~0 := 2; 741#L165-1 start_simulation_~kernel_st~0 := 3; 802#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 821#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 833#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 722#L271-3 assume !(0 == ~E_1~0); 723#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 731#L126-9 assume !(1 == ~m_pc~0); 858#L126-11 is_master_triggered_~__retres1~0 := 0; 856#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 854#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 851#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 834#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 812#L145-9 assume !(1 == ~t1_pc~0); 809#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 810#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 771#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 691#L329-9 assume !(0 != activate_threads_~tmp___0~0); 692#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 787#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 788#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 822#L299-3 assume 1 == ~E_1~0;~E_1~0 := 2; 712#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 713#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 716#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 717#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 783#L449 assume !(0 == start_simulation_~tmp~3); 767#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 909#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 907#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 906#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 905#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 738#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 739#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 805#L462 assume !(0 != start_simulation_~tmp___0~1); 701#L430-1 [2019-11-28 03:45:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125501, now seen corresponding path program 1 times [2019-11-28 03:45:15,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428476506] [2019-11-28 03:45:15,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428476506] [2019-11-28 03:45:15,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 03:45:15,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890893096] [2019-11-28 03:45:15,493 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:45:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1056018990, now seen corresponding path program 1 times [2019-11-28 03:45:15,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664088219] [2019-11-28 03:45:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664088219] [2019-11-28 03:45:15,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:15,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283947536] [2019-11-28 03:45:15,570 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:15,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:15,572 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. cyclomatic complexity: 116 Second operand 3 states. [2019-11-28 03:45:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:15,614 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2019-11-28 03:45:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:15,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 335 transitions. [2019-11-28 03:45:15,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-11-28 03:45:15,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 232 states and 335 transitions. [2019-11-28 03:45:15,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-11-28 03:45:15,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-11-28 03:45:15,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 335 transitions. [2019-11-28 03:45:15,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:45:15,627 INFO L688 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-11-28 03:45:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 335 transitions. [2019-11-28 03:45:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-28 03:45:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 03:45:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 335 transitions. [2019-11-28 03:45:15,644 INFO L711 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-11-28 03:45:15,644 INFO L591 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-11-28 03:45:15,645 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:45:15,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 335 transitions. [2019-11-28 03:45:15,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-11-28 03:45:15,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:15,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:15,648 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:15,648 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:15,649 INFO L794 eck$LassoCheckResult]: Stem: 1269#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1167#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1168#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1267#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 1192#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1193#L177-1 assume !(0 == ~M_E~0); 1202#L261-1 assume !(0 == ~T1_E~0); 1294#L266-1 assume !(0 == ~E_M~0); 1199#L271-1 assume !(0 == ~E_1~0); 1200#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1204#L126 assume !(1 == ~m_pc~0); 1261#L126-2 is_master_triggered_~__retres1~0 := 0; 1260#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1262#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1162#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1163#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1166#L145 assume !(1 == ~t1_pc~0); 1295#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 1296#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1256#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1171#L329 assume !(0 != activate_threads_~tmp___0~0); 1172#L329-2 assume !(1 == ~M_E~0); 1177#L289-1 assume !(1 == ~T1_E~0); 1270#L294-1 assume !(1 == ~E_M~0); 1173#L299-1 assume !(1 == ~E_1~0); 1174#L430-1 [2019-11-28 03:45:15,649 INFO L796 eck$LassoCheckResult]: Loop: 1174#L430-1 assume !false; 1371#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1274#L236 assume !false; 1370#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1369#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1205#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1206#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 1303#L217 assume !(0 != eval_~tmp~0); 1329#L251 start_simulation_~kernel_st~0 := 2; 1328#L165-1 start_simulation_~kernel_st~0 := 3; 1327#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1326#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1325#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1323#L271-3 assume !(0 == ~E_1~0); 1321#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1319#L126-9 assume !(1 == ~m_pc~0); 1317#L126-11 is_master_triggered_~__retres1~0 := 0; 1316#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1315#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1299#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1300#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1282#L145-9 assume !(1 == ~t1_pc~0); 1279#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 1280#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1243#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1164#L329-9 assume !(0 != activate_threads_~tmp___0~0); 1165#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1257#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1258#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1290#L299-3 assume !(1 == ~E_1~0); 1184#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1185#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1189#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1190#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1253#L449 assume !(0 == start_simulation_~tmp~3); 1254#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1379#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1377#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1376#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 1375#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1374#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 1373#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1372#L462 assume !(0 != start_simulation_~tmp___0~1); 1174#L430-1 [2019-11-28 03:45:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125503, now seen corresponding path program 1 times [2019-11-28 03:45:15,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386232327] [2019-11-28 03:45:15,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386232327] [2019-11-28 03:45:15,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:15,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011482128] [2019-11-28 03:45:15,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:45:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2067136240, now seen corresponding path program 1 times [2019-11-28 03:45:15,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225093502] [2019-11-28 03:45:15,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:15,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225093502] [2019-11-28 03:45:15,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:15,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:15,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471800367] [2019-11-28 03:45:15,790 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:15,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:45:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:45:15,791 INFO L87 Difference]: Start difference. First operand 232 states and 335 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-11-28 03:45:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:15,963 INFO L93 Difference]: Finished difference Result 604 states and 857 transitions. [2019-11-28 03:45:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:45:15,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 857 transitions. [2019-11-28 03:45:15,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 549 [2019-11-28 03:45:15,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 857 transitions. [2019-11-28 03:45:15,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 604 [2019-11-28 03:45:15,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 604 [2019-11-28 03:45:15,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 857 transitions. [2019-11-28 03:45:15,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:45:15,978 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 857 transitions. [2019-11-28 03:45:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 857 transitions. [2019-11-28 03:45:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 256. [2019-11-28 03:45:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-28 03:45:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 359 transitions. [2019-11-28 03:45:15,992 INFO L711 BuchiCegarLoop]: Abstraction has 256 states and 359 transitions. [2019-11-28 03:45:15,992 INFO L591 BuchiCegarLoop]: Abstraction has 256 states and 359 transitions. [2019-11-28 03:45:15,992 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:45:15,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 359 transitions. [2019-11-28 03:45:15,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 225 [2019-11-28 03:45:15,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:15,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:15,996 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:15,996 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:15,997 INFO L794 eck$LassoCheckResult]: Stem: 2126#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2018#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2019#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2119#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 2043#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2044#L177-1 assume !(0 == ~M_E~0); 2053#L261-1 assume !(0 == ~T1_E~0); 2161#L266-1 assume !(0 == ~E_M~0); 2050#L271-1 assume !(0 == ~E_1~0); 2051#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2055#L126 assume !(1 == ~m_pc~0); 2112#L126-2 is_master_triggered_~__retres1~0 := 0; 2139#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2146#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2012#L321 assume !(0 != activate_threads_~tmp~1); 2013#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2017#L145 assume !(1 == ~t1_pc~0); 2162#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 2163#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2107#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2020#L329 assume !(0 != activate_threads_~tmp___0~0); 2021#L329-2 assume !(1 == ~M_E~0); 2028#L289-1 assume !(1 == ~T1_E~0); 2127#L294-1 assume !(1 == ~E_M~0); 2022#L299-1 assume !(1 == ~E_1~0); 2023#L430-1 [2019-11-28 03:45:15,997 INFO L796 eck$LassoCheckResult]: Loop: 2023#L430-1 assume !false; 2030#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2031#L236 assume !false; 2057#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2058#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2049#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2056#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 2159#L217 assume !(0 != eval_~tmp~0); 2062#L251 start_simulation_~kernel_st~0 := 2; 2063#L165-1 start_simulation_~kernel_st~0 := 3; 2128#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2153#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2154#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2046#L271-3 assume !(0 == ~E_1~0); 2047#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2054#L126-9 assume 1 == ~m_pc~0; 2069#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 2070#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2137#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2232#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2166#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2144#L145-9 assume !(1 == ~t1_pc~0); 2145#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 2179#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2180#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2015#L329-9 assume !(0 != activate_threads_~tmp___0~0); 2016#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2108#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2109#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2157#L299-3 assume !(1 == ~E_1~0); 2221#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2213#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2210#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2208#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2207#L449 assume !(0 == start_simulation_~tmp~3); 2089#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2103#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2038#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2039#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 2148#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2060#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 2061#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2131#L462 assume !(0 != start_simulation_~tmp___0~1); 2023#L430-1 [2019-11-28 03:45:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2019-11-28 03:45:15,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:15,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080650070] [2019-11-28 03:45:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1758697231, now seen corresponding path program 1 times [2019-11-28 03:45:16,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:16,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086586131] [2019-11-28 03:45:16,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:16,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086586131] [2019-11-28 03:45:16,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:16,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:16,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137946767] [2019-11-28 03:45:16,102 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:16,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:45:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:45:16,103 INFO L87 Difference]: Start difference. First operand 256 states and 359 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-11-28 03:45:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:16,202 INFO L93 Difference]: Finished difference Result 432 states and 596 transitions. [2019-11-28 03:45:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:45:16,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 596 transitions. [2019-11-28 03:45:16,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 399 [2019-11-28 03:45:16,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 432 states and 596 transitions. [2019-11-28 03:45:16,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2019-11-28 03:45:16,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2019-11-28 03:45:16,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 596 transitions. [2019-11-28 03:45:16,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:45:16,215 INFO L688 BuchiCegarLoop]: Abstraction has 432 states and 596 transitions. [2019-11-28 03:45:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 596 transitions. [2019-11-28 03:45:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 262. [2019-11-28 03:45:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-28 03:45:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2019-11-28 03:45:16,225 INFO L711 BuchiCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-11-28 03:45:16,226 INFO L591 BuchiCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-11-28 03:45:16,226 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:45:16,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 365 transitions. [2019-11-28 03:45:16,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 231 [2019-11-28 03:45:16,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:16,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:16,230 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:16,230 INFO L850 BuchiCegarLoop]: Counterexample loop 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] [2019-11-28 03:45:16,230 INFO L794 eck$LassoCheckResult]: Stem: 2831#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2722#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2723#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2826#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 2747#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2748#L177-1 assume !(0 == ~M_E~0); 2758#L261-1 assume !(0 == ~T1_E~0); 2861#L266-1 assume !(0 == ~E_M~0); 2755#L271-1 assume !(0 == ~E_1~0); 2756#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2760#L126 assume !(1 == ~m_pc~0); 2820#L126-2 is_master_triggered_~__retres1~0 := 0; 2841#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2821#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2716#L321 assume !(0 != activate_threads_~tmp~1); 2717#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2721#L145 assume !(1 == ~t1_pc~0); 2862#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 2863#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2814#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2724#L329 assume !(0 != activate_threads_~tmp___0~0); 2725#L329-2 assume !(1 == ~M_E~0); 2732#L289-1 assume !(1 == ~T1_E~0); 2832#L294-1 assume !(1 == ~E_M~0); 2726#L299-1 assume !(1 == ~E_1~0); 2727#L430-1 [2019-11-28 03:45:16,231 INFO L796 eck$LassoCheckResult]: Loop: 2727#L430-1 assume !false; 2734#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2735#L236 assume !false; 2762#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2763#L190 assume !(0 == ~m_st~0); 2752#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2754#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2910#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 2909#L217 assume !(0 != eval_~tmp~0); 2767#L251 start_simulation_~kernel_st~0 := 2; 2768#L165-1 start_simulation_~kernel_st~0 := 3; 2833#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2852#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2853#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2898#L271-3 assume !(0 == ~E_1~0); 2897#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2896#L126-9 assume 1 == ~m_pc~0; 2894#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 2892#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2889#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2886#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2869#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2844#L145-9 assume !(1 == ~t1_pc~0); 2845#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 2881#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2882#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2719#L329-9 assume !(0 != activate_threads_~tmp___0~0); 2720#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2816#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2817#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2870#L299-3 assume !(1 == ~E_1~0); 2871#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2815#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2744#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2745#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2811#L449 assume !(0 == start_simulation_~tmp~3); 2812#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2810#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2742#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2743#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 2847#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2961#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 2960#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2959#L462 assume !(0 != start_simulation_~tmp___0~1); 2727#L430-1 [2019-11-28 03:45:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2019-11-28 03:45:16,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:16,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044071679] [2019-11-28 03:45:16,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 844256468, now seen corresponding path program 1 times [2019-11-28 03:45:16,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:16,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684593960] [2019-11-28 03:45:16,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:16,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1654840916, now seen corresponding path program 1 times [2019-11-28 03:45:16,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:16,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677762379] [2019-11-28 03:45:16,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:16,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677762379] [2019-11-28 03:45:16,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:16,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:45:16,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516223589] [2019-11-28 03:45:16,627 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-11-28 03:45:16,739 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:45:16,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:45:16,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:45:16,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:45:16,741 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:45:16,741 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:16,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:45:16,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:45:16,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: token_ring.01.cil-2.c_Iteration6_Loop [2019-11-28 03:45:16,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:45:16,742 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:45:16,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:16,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,279 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:45:17,280 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:17,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,292 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,309 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret2=0} Honda state: {ULTIMATE.start_eval_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:17,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,369 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,382 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,450 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:17,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,496 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,507 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,507 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_pc~0=-8} Honda state: {~t1_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,541 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,541 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~E_1~0=3} Honda state: {~E_1~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret7=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,600 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,615 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,615 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,623 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,633 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,633 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,645 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,657 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,657 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,670 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,670 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_st~0=-5} Honda state: {~t1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:17,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,691 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:45:17,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret6=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:45:17,708 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:45:17,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:45:17,741 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:45:17,743 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:45:17,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:45:17,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:45:17,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:45:17,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:45:17,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:17,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:45:17,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:45:17,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: token_ring.01.cil-2.c_Iteration6_Loop [2019-11-28 03:45:17,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:45:17,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:45:17,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:17,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:45:18,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:45:18,201 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:45:18,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:45:18,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,288 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:45:18,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,289 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:45:18,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,314 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:45:18,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,316 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:45:18,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,412 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:45:18,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,414 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:45:18,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,431 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:45:18,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,432 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:45:18,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:45:18,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:45:18,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:45:18,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:45:18,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:45:18,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:45:18,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:45:18,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:45:18,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:45:18,552 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:45:18,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:45:18,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:45:18,560 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:45:18,560 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M_E~0) = -1*~M_E~0 + 1 Supporting invariants [] [2019-11-28 03:45:18,570 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:45:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:18,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:45:18,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:45:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:18,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:45:18,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:45:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:18,734 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:45:18,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 262 states and 365 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-11-28 03:45:18,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 262 states and 365 transitions. cyclomatic complexity: 105. Second operand 5 states. Result 656 states and 924 transitions. Complement of second has 5 states. [2019-11-28 03:45:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:45:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:45:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2019-11-28 03:45:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 25 letters. Loop has 44 letters. [2019-11-28 03:45:18,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:45:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 69 letters. Loop has 44 letters. [2019-11-28 03:45:18,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:45:18,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 25 letters. Loop has 88 letters. [2019-11-28 03:45:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:45:18,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 924 transitions. [2019-11-28 03:45:18,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 421 [2019-11-28 03:45:18,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 924 transitions. [2019-11-28 03:45:18,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2019-11-28 03:45:18,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2019-11-28 03:45:18,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 924 transitions. [2019-11-28 03:45:18,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:18,886 INFO L688 BuchiCegarLoop]: Abstraction has 656 states and 924 transitions. [2019-11-28 03:45:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 924 transitions. [2019-11-28 03:45:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 651. [2019-11-28 03:45:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-28 03:45:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 915 transitions. [2019-11-28 03:45:18,908 INFO L711 BuchiCegarLoop]: Abstraction has 651 states and 915 transitions. [2019-11-28 03:45:18,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:18,909 INFO L87 Difference]: Start difference. First operand 651 states and 915 transitions. Second operand 3 states. [2019-11-28 03:45:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:18,957 INFO L93 Difference]: Finished difference Result 1018 states and 1386 transitions. [2019-11-28 03:45:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:18,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1018 states and 1386 transitions. [2019-11-28 03:45:18,972 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 674 [2019-11-28 03:45:18,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1018 states to 1018 states and 1386 transitions. [2019-11-28 03:45:18,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 [2019-11-28 03:45:18,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2019-11-28 03:45:18,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1018 states and 1386 transitions. [2019-11-28 03:45:18,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:18,983 INFO L688 BuchiCegarLoop]: Abstraction has 1018 states and 1386 transitions. [2019-11-28 03:45:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states and 1386 transitions. [2019-11-28 03:45:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 973. [2019-11-28 03:45:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-11-28 03:45:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1329 transitions. [2019-11-28 03:45:19,012 INFO L711 BuchiCegarLoop]: Abstraction has 973 states and 1329 transitions. [2019-11-28 03:45:19,012 INFO L591 BuchiCegarLoop]: Abstraction has 973 states and 1329 transitions. [2019-11-28 03:45:19,012 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:45:19,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 973 states and 1329 transitions. [2019-11-28 03:45:19,019 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 644 [2019-11-28 03:45:19,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:19,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:19,021 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:19,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:45:19,022 INFO L794 eck$LassoCheckResult]: Stem: 5743#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5546#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5547#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 5735#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 5590#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5591#L177-1 assume !(0 == ~M_E~0); 5608#L261-1 assume !(0 == ~T1_E~0); 5803#L266-1 assume !(0 == ~E_M~0); 5605#L271-1 assume !(0 == ~E_1~0); 5606#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5612#L126 assume !(1 == ~m_pc~0); 5728#L126-2 is_master_triggered_~__retres1~0 := 0; 5767#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5773#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5537#L321 assume !(0 != activate_threads_~tmp~1); 5538#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5545#L145 assume !(1 == ~t1_pc~0); 5804#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 5805#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5715#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5548#L329 assume !(0 != activate_threads_~tmp___0~0); 5549#L329-2 assume !(1 == ~M_E~0); 5558#L289-1 assume !(1 == ~T1_E~0); 5744#L294-1 assume !(1 == ~E_M~0); 5550#L299-1 assume !(1 == ~E_1~0); 5551#L430-1 assume !false; 5561#L431 [2019-11-28 03:45:19,029 INFO L796 eck$LassoCheckResult]: Loop: 5561#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5562#L236 assume !false; 6481#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5720#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5721#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6475#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 5798#L217 assume 0 != eval_~tmp~0; 5788#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 5789#L225 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0, master_#t~nondet1, master_~tmp_var~0;master_~tmp_var~0 := master_#t~nondet0;havoc master_#t~nondet0; 5828#L34 assume 0 == ~m_pc~0; 5571#L70 assume !false; 5572#L46 ~token~0 := master_#t~nondet1;havoc master_#t~nondet1;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5756#L126-3 assume !(1 == ~m_pc~0); 5757#L126-5 is_master_triggered_~__retres1~0 := 0; 6495#L137-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6493#L138-1 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6491#L321-3 assume !(0 != activate_threads_~tmp~1); 6489#L321-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6488#L145-3 assume !(1 == ~t1_pc~0); 5832#L145-5 is_transmit1_triggered_~__retres1~1 := 0; 5813#L156-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5705#L157-1 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5559#L329-3 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 5529#L329-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 5530#L222 assume !(0 == ~t1_st~0); 5831#L236 assume !false; 5616#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5617#L190 assume !(0 == ~m_st~0); 5599#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 5601#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6480#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 6479#L217 assume !(0 != eval_~tmp~0); 5626#L251 start_simulation_~kernel_st~0 := 2; 5627#L165-1 start_simulation_~kernel_st~0 := 3; 5745#L261-2 assume !(0 == ~M_E~0); 5792#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 6110#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 6108#L271-3 assume !(0 == ~E_1~0); 6106#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 6104#L126-9 assume 1 == ~m_pc~0; 6101#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 6099#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6097#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6094#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 6092#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6090#L145-9 assume !(1 == ~t1_pc~0); 6088#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 6086#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6084#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6082#L329-9 assume !(0 != activate_threads_~tmp___0~0); 6080#L329-11 assume !(1 == ~M_E~0); 6081#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6072#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 6073#L299-3 assume !(1 == ~E_1~0); 6041#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5716#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5583#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5584#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 5710#L449 assume !(0 == start_simulation_~tmp~3); 5711#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5718#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5998#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6487#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 6486#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6485#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 6484#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6483#L462 assume !(0 != start_simulation_~tmp___0~1); 6482#L430-1 assume !false; 5561#L431 [2019-11-28 03:45:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 1 times [2019-11-28 03:45:19,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046846057] [2019-11-28 03:45:19,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 827320895, now seen corresponding path program 1 times [2019-11-28 03:45:19,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667811492] [2019-11-28 03:45:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:19,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667811492] [2019-11-28 03:45:19,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:19,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:45:19,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117261552] [2019-11-28 03:45:19,138 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:19,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:45:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:45:19,141 INFO L87 Difference]: Start difference. First operand 973 states and 1329 transitions. cyclomatic complexity: 362 Second operand 5 states. [2019-11-28 03:45:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:19,270 INFO L93 Difference]: Finished difference Result 1413 states and 1915 transitions. [2019-11-28 03:45:19,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:45:19,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1413 states and 1915 transitions. [2019-11-28 03:45:19,285 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 936 [2019-11-28 03:45:19,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1413 states to 1413 states and 1915 transitions. [2019-11-28 03:45:19,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 974 [2019-11-28 03:45:19,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2019-11-28 03:45:19,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1413 states and 1915 transitions. [2019-11-28 03:45:19,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:19,298 INFO L688 BuchiCegarLoop]: Abstraction has 1413 states and 1915 transitions. [2019-11-28 03:45:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states and 1915 transitions. [2019-11-28 03:45:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 982. [2019-11-28 03:45:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-11-28 03:45:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1312 transitions. [2019-11-28 03:45:19,320 INFO L711 BuchiCegarLoop]: Abstraction has 982 states and 1312 transitions. [2019-11-28 03:45:19,320 INFO L591 BuchiCegarLoop]: Abstraction has 982 states and 1312 transitions. [2019-11-28 03:45:19,320 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:45:19,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 982 states and 1312 transitions. [2019-11-28 03:45:19,326 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 650 [2019-11-28 03:45:19,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:19,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:19,328 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:19,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:45:19,328 INFO L794 eck$LassoCheckResult]: Stem: 8145#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 7948#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 7949#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 8139#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 7990#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 7991#L177-1 assume !(0 == ~M_E~0); 8010#L261-1 assume !(0 == ~T1_E~0); 8207#L266-1 assume !(0 == ~E_M~0); 8006#L271-1 assume !(0 == ~E_1~0); 8007#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8013#L126 assume !(1 == ~m_pc~0); 8132#L126-2 is_master_triggered_~__retres1~0 := 0; 8166#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8269#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7937#L321 assume !(0 != activate_threads_~tmp~1); 7938#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7947#L145 assume !(1 == ~t1_pc~0); 8208#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 8209#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8119#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7950#L329 assume !(0 != activate_threads_~tmp___0~0); 7951#L329-2 assume !(1 == ~M_E~0); 7960#L289-1 assume !(1 == ~T1_E~0); 8146#L294-1 assume !(1 == ~E_M~0); 7952#L299-1 assume !(1 == ~E_1~0); 7953#L430-1 assume !false; 8385#L431 [2019-11-28 03:45:19,329 INFO L796 eck$LassoCheckResult]: Loop: 8385#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8641#L236 assume !false; 8638#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8636#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8548#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8633#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 8631#L217 assume 0 != eval_~tmp~0; 8630#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 8565#L225 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0, master_#t~nondet1, master_~tmp_var~0;master_~tmp_var~0 := master_#t~nondet0;havoc master_#t~nondet0; 8622#L34 assume 0 == ~m_pc~0; 8618#L70 assume !false; 8615#L46 ~token~0 := master_#t~nondet1;havoc master_#t~nondet1;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8611#L126-3 assume 1 == ~m_pc~0; 8605#L127-1 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 8601#L137-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8595#L138-1 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8591#L321-3 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8588#L321-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8263#L145-3 assume !(1 == ~t1_pc~0); 8264#L145-5 is_transmit1_triggered_~__retres1~1 := 0; 8581#L156-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8576#L157-1 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8570#L329-3 assume !(0 != activate_threads_~tmp___0~0); 8564#L329-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 8557#L222 assume !(0 == ~t1_st~0); 8552#L236 assume !false; 8550#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8547#L190 assume !(0 == ~m_st~0); 8543#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 8540#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8538#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 8535#L217 assume !(0 != eval_~tmp~0); 8532#L251 start_simulation_~kernel_st~0 := 2; 8530#L165-1 start_simulation_~kernel_st~0 := 3; 8528#L261-2 assume !(0 == ~M_E~0); 8526#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 8524#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 8522#L271-3 assume !(0 == ~E_1~0); 8520#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8518#L126-9 assume 1 == ~m_pc~0; 8515#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 8512#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8510#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8507#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8504#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8502#L145-9 assume !(1 == ~t1_pc~0); 8500#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 8498#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8496#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8494#L329-9 assume !(0 != activate_threads_~tmp___0~0); 8492#L329-11 assume !(1 == ~M_E~0); 8486#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 8487#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 8478#L299-3 assume !(1 == ~E_1~0); 8479#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8467#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8468#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8453#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 8454#L449 assume !(0 == start_simulation_~tmp~3); 8674#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8672#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8600#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8669#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 8668#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8666#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 8664#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8662#L462 assume !(0 != start_simulation_~tmp___0~1); 8660#L430-1 assume !false; 8385#L431 [2019-11-28 03:45:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 2 times [2019-11-28 03:45:19,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135149436] [2019-11-28 03:45:19,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1209503008, now seen corresponding path program 1 times [2019-11-28 03:45:19,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639136068] [2019-11-28 03:45:19,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639136068] [2019-11-28 03:45:19,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:19,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:45:19,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240717115] [2019-11-28 03:45:19,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:45:19,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:19,387 INFO L87 Difference]: Start difference. First operand 982 states and 1312 transitions. cyclomatic complexity: 336 Second operand 3 states. [2019-11-28 03:45:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:19,424 INFO L93 Difference]: Finished difference Result 1160 states and 1516 transitions. [2019-11-28 03:45:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:19,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1160 states and 1516 transitions. [2019-11-28 03:45:19,434 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 752 [2019-11-28 03:45:19,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1160 states to 1160 states and 1516 transitions. [2019-11-28 03:45:19,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 791 [2019-11-28 03:45:19,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 791 [2019-11-28 03:45:19,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1160 states and 1516 transitions. [2019-11-28 03:45:19,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:19,444 INFO L688 BuchiCegarLoop]: Abstraction has 1160 states and 1516 transitions. [2019-11-28 03:45:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states and 1516 transitions. [2019-11-28 03:45:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1082. [2019-11-28 03:45:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-11-28 03:45:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1429 transitions. [2019-11-28 03:45:19,465 INFO L711 BuchiCegarLoop]: Abstraction has 1082 states and 1429 transitions. [2019-11-28 03:45:19,466 INFO L591 BuchiCegarLoop]: Abstraction has 1082 states and 1429 transitions. [2019-11-28 03:45:19,466 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:45:19,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1082 states and 1429 transitions. [2019-11-28 03:45:19,472 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 700 [2019-11-28 03:45:19,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:19,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:19,473 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:19,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:45:19,474 INFO L794 eck$LassoCheckResult]: Stem: 10283#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 10095#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10096#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 10276#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 10140#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 10141#L177-1 assume !(0 == ~M_E~0); 10159#L261-1 assume !(0 == ~T1_E~0); 10349#L266-1 assume !(0 == ~E_M~0); 10156#L271-1 assume !(0 == ~E_1~0); 10157#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10163#L126 assume !(1 == ~m_pc~0); 10308#L126-2 is_master_triggered_~__retres1~0 := 0; 10309#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10271#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 10085#L321 assume !(0 != activate_threads_~tmp~1); 10086#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10094#L145 assume !(1 == ~t1_pc~0); 10350#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 10351#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10265#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10097#L329 assume !(0 != activate_threads_~tmp___0~0); 10098#L329-2 assume !(1 == ~M_E~0); 10107#L289-1 assume !(1 == ~T1_E~0); 10284#L294-1 assume !(1 == ~E_M~0); 10099#L299-1 assume !(1 == ~E_1~0); 10100#L430-1 assume !false; 10442#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 10937#L236 [2019-11-28 03:45:19,474 INFO L796 eck$LassoCheckResult]: Loop: 10937#L236 assume !false; 10935#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10933#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10932#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10930#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 10928#L217 assume 0 != eval_~tmp~0; 10926#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 10924#L225 assume !(0 != eval_~tmp_ndt_1~0); 10925#L222 assume !(0 == ~t1_st~0); 10937#L236 [2019-11-28 03:45:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2019-11-28 03:45:19,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521838893] [2019-11-28 03:45:19,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1331440565, now seen corresponding path program 1 times [2019-11-28 03:45:19,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418463573] [2019-11-28 03:45:19,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 610963913, now seen corresponding path program 1 times [2019-11-28 03:45:19,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372612344] [2019-11-28 03:45:19,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:19,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372612344] [2019-11-28 03:45:19,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:19,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:45:19,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170229991] [2019-11-28 03:45:19,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:19,578 INFO L87 Difference]: Start difference. First operand 1082 states and 1429 transitions. cyclomatic complexity: 357 Second operand 3 states. [2019-11-28 03:45:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:19,609 INFO L93 Difference]: Finished difference Result 1619 states and 2100 transitions. [2019-11-28 03:45:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:19,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2100 transitions. [2019-11-28 03:45:19,622 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 980 [2019-11-28 03:45:19,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1619 states and 2100 transitions. [2019-11-28 03:45:19,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1119 [2019-11-28 03:45:19,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1119 [2019-11-28 03:45:19,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1619 states and 2100 transitions. [2019-11-28 03:45:19,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:19,637 INFO L688 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-11-28 03:45:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states and 2100 transitions. [2019-11-28 03:45:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2019-11-28 03:45:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2019-11-28 03:45:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2100 transitions. [2019-11-28 03:45:19,672 INFO L711 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-11-28 03:45:19,672 INFO L591 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-11-28 03:45:19,672 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:45:19,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1619 states and 2100 transitions. [2019-11-28 03:45:19,682 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 980 [2019-11-28 03:45:19,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:19,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:19,685 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:19,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:45:19,686 INFO L794 eck$LassoCheckResult]: Stem: 12992#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 12803#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12804#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12986#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 12848#L172-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 12849#L177-1 assume !(0 == ~M_E~0); 13486#L261-1 assume !(0 == ~T1_E~0); 13485#L266-1 assume !(0 == ~E_M~0); 13484#L271-1 assume !(0 == ~E_1~0); 13483#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13482#L126 assume !(1 == ~m_pc~0); 13481#L126-2 is_master_triggered_~__retres1~0 := 0; 13480#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13479#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13478#L321 assume !(0 != activate_threads_~tmp~1); 13477#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13476#L145 assume !(1 == ~t1_pc~0); 13475#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 13474#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13473#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 13472#L329 assume !(0 != activate_threads_~tmp___0~0); 13471#L329-2 assume !(1 == ~M_E~0); 13470#L289-1 assume !(1 == ~T1_E~0); 13469#L294-1 assume !(1 == ~E_M~0); 13468#L299-1 assume !(1 == ~E_1~0); 13466#L430-1 assume !false; 13467#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13666#L236 [2019-11-28 03:45:19,686 INFO L796 eck$LassoCheckResult]: Loop: 13666#L236 assume !false; 13663#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13660#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13658#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13655#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 13651#L217 assume 0 != eval_~tmp~0; 13648#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 13643#L225 assume !(0 != eval_~tmp_ndt_1~0); 13644#L222 assume !(0 == ~t1_st~0); 13666#L236 [2019-11-28 03:45:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1150267205, now seen corresponding path program 1 times [2019-11-28 03:45:19,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582390170] [2019-11-28 03:45:19,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:45:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:45:19,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582390170] [2019-11-28 03:45:19,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:45:19,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:45:19,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075211800] [2019-11-28 03:45:19,700 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:45:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1331440565, now seen corresponding path program 2 times [2019-11-28 03:45:19,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72921004] [2019-11-28 03:45:19,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:45:19,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:45:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:45:19,752 INFO L87 Difference]: Start difference. First operand 1619 states and 2100 transitions. cyclomatic complexity: 496 Second operand 3 states. [2019-11-28 03:45:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:45:19,762 INFO L93 Difference]: Finished difference Result 1037 states and 1346 transitions. [2019-11-28 03:45:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:45:19,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1037 states and 1346 transitions. [2019-11-28 03:45:19,770 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 652 [2019-11-28 03:45:19,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1037 states to 1037 states and 1346 transitions. [2019-11-28 03:45:19,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 688 [2019-11-28 03:45:19,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 688 [2019-11-28 03:45:19,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1037 states and 1346 transitions. [2019-11-28 03:45:19,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:45:19,779 INFO L688 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-11-28 03:45:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states and 1346 transitions. [2019-11-28 03:45:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2019-11-28 03:45:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-28 03:45:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1346 transitions. [2019-11-28 03:45:19,796 INFO L711 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-11-28 03:45:19,797 INFO L591 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-11-28 03:45:19,797 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:45:19,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1037 states and 1346 transitions. [2019-11-28 03:45:19,802 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 652 [2019-11-28 03:45:19,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:19,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:19,803 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-28 03:45:19,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:45:19,804 INFO L794 eck$LassoCheckResult]: Stem: 15655#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 15466#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 15467#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 15649#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 15510#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 15511#L177-1 assume !(0 == ~M_E~0); 15528#L261-1 assume !(0 == ~T1_E~0); 15713#L266-1 assume !(0 == ~E_M~0); 15525#L271-1 assume !(0 == ~E_1~0); 15526#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 15532#L126 assume !(1 == ~m_pc~0); 15673#L126-2 is_master_triggered_~__retres1~0 := 0; 15674#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 15644#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15456#L321 assume !(0 != activate_threads_~tmp~1); 15457#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 15465#L145 assume !(1 == ~t1_pc~0); 15714#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 15715#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 15636#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15468#L329 assume !(0 != activate_threads_~tmp___0~0); 15469#L329-2 assume !(1 == ~M_E~0); 15478#L289-1 assume !(1 == ~T1_E~0); 15656#L294-1 assume !(1 == ~E_M~0); 15470#L299-1 assume !(1 == ~E_1~0); 15471#L430-1 assume !false; 15481#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 15482#L236 [2019-11-28 03:45:19,804 INFO L796 eck$LassoCheckResult]: Loop: 15482#L236 assume !false; 16474#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16473#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 16471#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16469#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 16468#L217 assume 0 != eval_~tmp~0; 16467#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 16464#L225 assume !(0 != eval_~tmp_ndt_1~0); 16465#L222 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 16475#L239 assume !(0 != eval_~tmp_ndt_2~0); 15482#L236 [2019-11-28 03:45:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 2 times [2019-11-28 03:45:19,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234620600] [2019-11-28 03:45:19,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1675013239, now seen corresponding path program 1 times [2019-11-28 03:45:19,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485727973] [2019-11-28 03:45:19,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1760009913, now seen corresponding path program 1 times [2019-11-28 03:45:19,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:19,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104247828] [2019-11-28 03:45:19,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:45:19,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:45:20,043 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-11-28 03:45:20,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:45:20 BoogieIcfgContainer [2019-11-28 03:45:20,121 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:45:20,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:45:20,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:45:20,122 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:45:20,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:14" (3/4) ... [2019-11-28 03:45:20,125 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:45:20,179 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:45:20,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:45:20,181 INFO L168 Benchmark]: Toolchain (without parser) took 6702.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 132.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:45:20,181 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:45:20,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:45:20,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:45:20,183 INFO L168 Benchmark]: Boogie Preprocessor took 43.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:45:20,183 INFO L168 Benchmark]: RCFGBuilder took 623.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:45:20,184 INFO L168 Benchmark]: BuchiAutomizer took 5494.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.3 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:45:20,184 INFO L168 Benchmark]: Witness Printer took 57.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:45:20,186 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 623.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5494.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.3 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * M_E + 1 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1037 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1079 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1619 states and ocurred in iteration 9. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2359 SDtfs, 2447 SDslu, 2661 SDs, 0 SdLazy, 237 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT1 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 212]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, token=0, __retres1=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a5d4cae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74a01117=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5deec334=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, \result=0, E_1=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e2b80ca=0, tmp_ndt_1=0, M_E=2, tmp_ndt_2=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59251405=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@260320d5=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5af9d9=0, t1_st=0, local=0, m_st=0, E_M=2, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 212]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 [L261] COND FALSE !(M_E == 0) [L266] COND FALSE !(T1_E == 0) [L271] COND FALSE !(E_M == 0) [L276] COND FALSE !(E_1 == 0) [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; [L126] COND FALSE !(m_pc == 1) [L136] __retres1 = 0 [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; [L145] COND FALSE !(t1_pc == 1) [L155] __retres1 = 0 [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L289] COND FALSE !(M_E == 1) [L294] COND FALSE !(T1_E == 1) [L299] COND FALSE !(E_M == 1) [L304] COND FALSE !(E_1 == 1) [L430] COND TRUE 1 [L433] kernel_st = 1 [L208] int tmp ; Loop: [L212] COND TRUE 1 [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...