./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.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 bface9c2aaf995719ea2868f2c86b44f41c1d67a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:47:41,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:47:41,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:47:41,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:47:41,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:47:41,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:47:41,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:47:41,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:47:41,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:47:41,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:47:41,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:47:41,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:47:41,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:47:41,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:47:41,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:47:41,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:47:41,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:47:41,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:47:41,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:47:41,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:47:41,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:47:41,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:47:41,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:47:41,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:47:41,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:47:41,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:47:41,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:47:41,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:47:41,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:47:41,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:47:41,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:47:41,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:47:41,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:47:41,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:47:41,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:47:41,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:47:41,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:47:41,634 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:47:41,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:47:41,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:47:41,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:47:41,636 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:47:41,636 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:47:41,636 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:47:41,637 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:47:41,637 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:47:41,637 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:47:41,637 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:47:41,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:47:41,637 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:47:41,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:47:41,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:47:41,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:47:41,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:47:41,640 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:47:41,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:47:41,640 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:47:41,641 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:47:41,641 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:47:41,642 INFO L133 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 -> bface9c2aaf995719ea2868f2c86b44f41c1d67a [2019-01-14 04:47:41,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:47:41,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:47:41,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:47:41,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:47:41,692 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:47:41,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:41,755 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfdd7a56/7e1d1d38b0124d49b1d8706c76841bab/FLAG33cd12fa0 [2019-01-14 04:47:42,237 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:47:42,238 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:42,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfdd7a56/7e1d1d38b0124d49b1d8706c76841bab/FLAG33cd12fa0 [2019-01-14 04:47:42,573 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfdd7a56/7e1d1d38b0124d49b1d8706c76841bab [2019-01-14 04:47:42,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:47:42,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:47:42,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:42,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:47:42,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:47:42,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:42" (1/1) ... [2019-01-14 04:47:42,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436cf83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:42, skipping insertion in model container [2019-01-14 04:47:42,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:42" (1/1) ... [2019-01-14 04:47:42,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:47:42,655 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:47:42,956 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:42,974 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:47:43,064 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:43,156 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:47:43,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43 WrapperNode [2019-01-14 04:47:43,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:43,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:43,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:47:43,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:47:43,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:43,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:47:43,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:47:43,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:47:43,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (1/1) ... [2019-01-14 04:47:43,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:47:43,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:47:43,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:47:43,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:47:43,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (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-01-14 04:47:43,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:47:43,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:47:44,385 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:47:44,386 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-14 04:47:44,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:44 BoogieIcfgContainer [2019-01-14 04:47:44,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:47:44,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:47:44,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:47:44,392 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:47:44,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:44,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:47:42" (1/3) ... [2019-01-14 04:47:44,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cfa0820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:44, skipping insertion in model container [2019-01-14 04:47:44,395 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:44,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:43" (2/3) ... [2019-01-14 04:47:44,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cfa0820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:44, skipping insertion in model container [2019-01-14 04:47:44,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:44,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:44" (3/3) ... [2019-01-14 04:47:44,398 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:44,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:47:44,450 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:47:44,450 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:47:44,450 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:47:44,452 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:47:44,453 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:47:44,453 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:47:44,453 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:47:44,453 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:47:44,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:47:44,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:47:44,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:44,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:44,513 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:44,513 INFO L868 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] [2019-01-14 04:47:44,514 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:47:44,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:47:44,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:47:44,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:44,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:44,525 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:44,525 INFO L868 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] [2019-01-14 04:47:44,534 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 88#L272true assume !(0 == ~r1~0);init_~tmp~0 := 0; 86#L272-1true init_#res := init_~tmp~0; 39#L433true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 102#L511-2true [2019-01-14 04:47:44,535 INFO L796 eck$LassoCheckResult]: Loop: 102#L511-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 15#L120true assume !(0 != ~mode1~0 % 256); 97#L134true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 109#L134-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 14#L120-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 62#L146true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 64#L149true assume !(node2_~m2~0 != ~nomsg~0); 49#L149-1true ~mode2~0 := 0; 59#L146-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 66#L171true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 55#L174true assume !(node3_~m3~0 != ~nomsg~0); 54#L174-1true ~mode3~0 := 0; 48#L171-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L196true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 32#L199true assume !(node4_~m4~0 != ~nomsg~0); 30#L199-1true ~mode4~0 := 0; 53#L196-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 33#L221true assume !(0 != ~mode5~0 % 256); 81#L234true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 63#L234-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 29#L221-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 37#L246true assume !(0 != ~mode6~0 % 256); 70#L259true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 67#L259-2true ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 23#L246-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 42#L441true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 43#L441-1true check_#res := check_~tmp~1; 20#L461true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8#L544true assume !(0 == assert_~arg % 256); 95#L539true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 102#L511-2true [2019-01-14 04:47:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2019-01-14 04:47:44,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:44,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:44,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:44,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:44,815 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:47:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 15305473, now seen corresponding path program 1 times [2019-01-14 04:47:44,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:45,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:45,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:45,056 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:47:45,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:47:45,072 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2019-01-14 04:47:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:45,217 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2019-01-14 04:47:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:47:45,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2019-01-14 04:47:45,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:45,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2019-01-14 04:47:45,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-14 04:47:45,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-01-14 04:47:45,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2019-01-14 04:47:45,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:45,237 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2019-01-14 04:47:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 04:47:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 04:47:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2019-01-14 04:47:45,278 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:45,278 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:45,278 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:47:45,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2019-01-14 04:47:45,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:45,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:45,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:45,285 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:45,285 INFO L868 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] [2019-01-14 04:47:45,286 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 244#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 245#L272 assume 0 == ~r1~0; 303#L273 assume ~id1~0 >= 0; 234#L274 assume 0 == ~st1~0; 235#L275 assume ~send1~0 == ~id1~0; 291#L276 assume 0 == ~mode1~0 % 256; 246#L277 assume ~id2~0 >= 0; 247#L278 assume 0 == ~st2~0; 295#L279 assume ~send2~0 == ~id2~0; 296#L280 assume 0 == ~mode2~0 % 256; 322#L281 assume ~id3~0 >= 0; 264#L282 assume 0 == ~st3~0; 265#L283 assume ~send3~0 == ~id3~0; 304#L284 assume 0 == ~mode3~0 % 256; 236#L285 assume ~id4~0 >= 0; 237#L286 assume 0 == ~st4~0; 310#L287 assume ~send4~0 == ~id4~0; 248#L288 assume 0 == ~mode4~0 % 256; 249#L289 assume ~id5~0 >= 0; 297#L290 assume 0 == ~st5~0; 298#L291 assume ~send5~0 == ~id5~0; 323#L292 assume 0 == ~mode5~0 % 256; 266#L293 assume ~id6~0 >= 0; 267#L294 assume 0 == ~st6~0; 305#L295 assume ~send6~0 == ~id6~0; 240#L296 assume 0 == ~mode6~0 % 256; 241#L297 assume ~id1~0 != ~id2~0; 311#L298 assume ~id1~0 != ~id3~0; 252#L299 assume ~id1~0 != ~id4~0; 253#L300 assume ~id1~0 != ~id5~0; 301#L301 assume ~id1~0 != ~id6~0; 302#L302 assume ~id2~0 != ~id3~0; 315#L303 assume ~id2~0 != ~id4~0; 278#L304 assume ~id2~0 != ~id5~0; 279#L305 assume ~id2~0 != ~id6~0; 312#L306 assume ~id3~0 != ~id4~0; 250#L307 assume ~id3~0 != ~id5~0; 251#L308 assume ~id3~0 != ~id6~0; 306#L309 assume ~id4~0 != ~id5~0; 238#L310 assume ~id4~0 != ~id6~0; 239#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 325#L272-1 init_#res := init_~tmp~0; 299#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 300#L511-2 [2019-01-14 04:47:45,289 INFO L796 eck$LassoCheckResult]: Loop: 300#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 256#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 257#L124 assume !(node1_~m1~0 != ~nomsg~0); 272#L124-1 ~mode1~0 := 0; 254#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 255#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 317#L149 assume !(node2_~m2~0 != ~nomsg~0); 260#L149-1 ~mode2~0 := 0; 309#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 316#L171 assume !(0 != ~mode3~0 % 256); 320#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 329#L184-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 307#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 308#L196 assume !(0 != ~mode4~0 % 256); 314#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 324#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 285#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 288#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 289#L224 assume !(node5_~m5~0 != ~nomsg~0); 292#L224-1 ~mode5~0 := 0; 282#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 283#L246 assume !(0 != ~mode6~0 % 256); 294#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 321#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 274#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 275#L441 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 270#L441-1 check_#res := check_~tmp~1; 268#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 242#L544 assume !(0 == assert_~arg % 256); 243#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 300#L511-2 [2019-01-14 04:47:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2019-01-14 04:47:45,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1179596289, now seen corresponding path program 1 times [2019-01-14 04:47:45,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:45,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:45,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:45,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:45,790 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:47:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:47:45,792 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-01-14 04:47:46,073 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:47:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:46,187 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2019-01-14 04:47:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:47:46,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2019-01-14 04:47:46,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:46,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2019-01-14 04:47:46,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-14 04:47:46,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-01-14 04:47:46,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2019-01-14 04:47:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:46,196 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2019-01-14 04:47:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 04:47:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 04:47:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-01-14 04:47:46,205 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:46,205 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:46,205 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:47:46,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2019-01-14 04:47:46,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:46,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:46,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:46,210 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:46,211 INFO L868 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] [2019-01-14 04:47:46,211 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 463#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 464#L272 assume 0 == ~r1~0; 522#L273 assume ~id1~0 >= 0; 453#L274 assume 0 == ~st1~0; 454#L275 assume ~send1~0 == ~id1~0; 510#L276 assume 0 == ~mode1~0 % 256; 465#L277 assume ~id2~0 >= 0; 466#L278 assume 0 == ~st2~0; 514#L279 assume ~send2~0 == ~id2~0; 515#L280 assume 0 == ~mode2~0 % 256; 541#L281 assume ~id3~0 >= 0; 483#L282 assume 0 == ~st3~0; 484#L283 assume ~send3~0 == ~id3~0; 523#L284 assume 0 == ~mode3~0 % 256; 455#L285 assume ~id4~0 >= 0; 456#L286 assume 0 == ~st4~0; 529#L287 assume ~send4~0 == ~id4~0; 467#L288 assume 0 == ~mode4~0 % 256; 468#L289 assume ~id5~0 >= 0; 516#L290 assume 0 == ~st5~0; 517#L291 assume ~send5~0 == ~id5~0; 542#L292 assume 0 == ~mode5~0 % 256; 485#L293 assume ~id6~0 >= 0; 486#L294 assume 0 == ~st6~0; 524#L295 assume ~send6~0 == ~id6~0; 459#L296 assume 0 == ~mode6~0 % 256; 460#L297 assume ~id1~0 != ~id2~0; 530#L298 assume ~id1~0 != ~id3~0; 471#L299 assume ~id1~0 != ~id4~0; 472#L300 assume ~id1~0 != ~id5~0; 520#L301 assume ~id1~0 != ~id6~0; 521#L302 assume ~id2~0 != ~id3~0; 534#L303 assume ~id2~0 != ~id4~0; 497#L304 assume ~id2~0 != ~id5~0; 498#L305 assume ~id2~0 != ~id6~0; 531#L306 assume ~id3~0 != ~id4~0; 469#L307 assume ~id3~0 != ~id5~0; 470#L308 assume ~id3~0 != ~id6~0; 525#L309 assume ~id4~0 != ~id5~0; 457#L310 assume ~id4~0 != ~id6~0; 458#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 544#L272-1 init_#res := init_~tmp~0; 518#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 519#L511-2 [2019-01-14 04:47:46,211 INFO L796 eck$LassoCheckResult]: Loop: 519#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 475#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 476#L124 assume !(node1_~m1~0 != ~nomsg~0); 491#L124-1 ~mode1~0 := 0; 473#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 474#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 536#L149 assume !(node2_~m2~0 != ~nomsg~0); 479#L149-1 ~mode2~0 := 0; 528#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 535#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 532#L174 assume !(node3_~m3~0 != ~nomsg~0); 451#L174-1 ~mode3~0 := 0; 526#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 527#L196 assume !(0 != ~mode4~0 % 256); 533#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 543#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 504#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 507#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 508#L224 assume !(node5_~m5~0 != ~nomsg~0); 511#L224-1 ~mode5~0 := 0; 501#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 502#L246 assume !(0 != ~mode6~0 % 256); 513#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 540#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 493#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 494#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 480#L442 assume ~r1~0 >= 6; 481#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 489#L441-1 check_#res := check_~tmp~1; 487#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 461#L544 assume !(0 == assert_~arg % 256); 462#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 519#L511-2 [2019-01-14 04:47:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2019-01-14 04:47:46,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1341300421, now seen corresponding path program 1 times [2019-01-14 04:47:46,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:46,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:46,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:47:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:47:46,422 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-14 04:47:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:46,472 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2019-01-14 04:47:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:47:46,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2019-01-14 04:47:46,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-01-14 04:47:46,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2019-01-14 04:47:46,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-14 04:47:46,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:47:46,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2019-01-14 04:47:46,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:46,481 INFO L706 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2019-01-14 04:47:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-01-14 04:47:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 04:47:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-01-14 04:47:46,491 INFO L729 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:46,492 INFO L609 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:46,492 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:47:46,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2019-01-14 04:47:46,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-01-14 04:47:46,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:46,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:46,497 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:46,498 INFO L868 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] [2019-01-14 04:47:46,498 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 725#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 726#L272 assume 0 == ~r1~0; 783#L273 assume ~id1~0 >= 0; 715#L274 assume 0 == ~st1~0; 716#L275 assume ~send1~0 == ~id1~0; 771#L276 assume 0 == ~mode1~0 % 256; 727#L277 assume ~id2~0 >= 0; 728#L278 assume 0 == ~st2~0; 775#L279 assume ~send2~0 == ~id2~0; 776#L280 assume 0 == ~mode2~0 % 256; 803#L281 assume ~id3~0 >= 0; 744#L282 assume 0 == ~st3~0; 745#L283 assume ~send3~0 == ~id3~0; 784#L284 assume 0 == ~mode3~0 % 256; 717#L285 assume ~id4~0 >= 0; 718#L286 assume 0 == ~st4~0; 790#L287 assume ~send4~0 == ~id4~0; 729#L288 assume 0 == ~mode4~0 % 256; 730#L289 assume ~id5~0 >= 0; 777#L290 assume 0 == ~st5~0; 778#L291 assume ~send5~0 == ~id5~0; 804#L292 assume 0 == ~mode5~0 % 256; 746#L293 assume ~id6~0 >= 0; 747#L294 assume 0 == ~st6~0; 785#L295 assume ~send6~0 == ~id6~0; 721#L296 assume 0 == ~mode6~0 % 256; 722#L297 assume ~id1~0 != ~id2~0; 791#L298 assume ~id1~0 != ~id3~0; 733#L299 assume ~id1~0 != ~id4~0; 734#L300 assume ~id1~0 != ~id5~0; 781#L301 assume ~id1~0 != ~id6~0; 782#L302 assume ~id2~0 != ~id3~0; 795#L303 assume ~id2~0 != ~id4~0; 758#L304 assume ~id2~0 != ~id5~0; 759#L305 assume ~id2~0 != ~id6~0; 792#L306 assume ~id3~0 != ~id4~0; 731#L307 assume ~id3~0 != ~id5~0; 732#L308 assume ~id3~0 != ~id6~0; 786#L309 assume ~id4~0 != ~id5~0; 719#L310 assume ~id4~0 != ~id6~0; 720#L311 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 806#L272-1 init_#res := init_~tmp~0; 779#L433 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 780#L511-2 [2019-01-14 04:47:46,498 INFO L796 eck$LassoCheckResult]: Loop: 780#L511-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 861#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 738#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 797#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 858#L146 assume !(0 != ~mode2~0 % 256); 854#L159 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 853#L159-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 851#L146-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 850#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 848#L174 assume !(node3_~m3~0 != ~nomsg~0); 844#L174-1 ~mode3~0 := 0; 843#L171-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 842#L196 assume !(0 != ~mode4~0 % 256); 838#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 837#L209-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 835#L196-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 834#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 832#L224 assume !(node5_~m5~0 != ~nomsg~0); 829#L224-1 ~mode5~0 := 0; 827#L221-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 826#L246 assume !(0 != ~mode6~0 % 256); 822#L259 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 820#L259-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 819#L246-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 818#L441 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 817#L442 assume !(~r1~0 >= 6); 815#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 816#L446 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L441-1 check_#res := check_~tmp~1; 864#L461 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L544 assume !(0 == assert_~arg % 256); 862#L539 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 780#L511-2 [2019-01-14 04:47:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2019-01-14 04:47:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash 636710160, now seen corresponding path program 1 times [2019-01-14 04:47:46,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:46,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1784458480, now seen corresponding path program 1 times [2019-01-14 04:47:46,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:46,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:47:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:47,688 WARN L181 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 173 [2019-01-14 04:47:55,549 WARN L181 SmtUtils]: Spent 7.77 s on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2019-01-14 04:47:55,561 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:55,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:55,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:55,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:55,563 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:47:55,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:55,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:55,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:55,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:47:55,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:55,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:55,587 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-01-14 04:47:55,780 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8932 disjunctions. This might take some time... [2019-01-14 04:47:56,030 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2019-01-14 04:47:56,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,438 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-14 04:47:56,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:56,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:57,010 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-01-14 04:47:57,278 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-14 04:48:56,600 WARN L181 SmtUtils]: Spent 59.13 s on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2019-01-14 04:48:56,912 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:56,913 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:56,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:48:56,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:49:04,150 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:49:04,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p1_old~0=-128, ~send6~0=128, ~nomsg~0=-128, ULTIMATE.start_node4_~m4~0=-128, ~p6_new~0=-128, ULTIMATE.start_node5_~m5~0=-128, ~p5_new~0=-128, ~p2_old~0=-128, ~p4_old~0=-128, ~p5_old~0=-128, ~p3_old~0=-128, ULTIMATE.start_node2_~m2~0=-128, ~p4_new~0=-128, ~p1_new~0=-128, ~p2_new~0=-128, ~p3_new~0=-128, ~p6_old~0=-128, ULTIMATE.start_node1_~m1~0=-128, ~send2~0=128, ULTIMATE.start_node6_~m6~0=-128, ~send4~0=128, ULTIMATE.start_node3_~m3~0=-128} Honda state: {~p1_old~0=-128, ~send6~0=128, ~nomsg~0=-128, ULTIMATE.start_node4_~m4~0=-128, ~p6_new~0=-128, ULTIMATE.start_node5_~m5~0=-128, ~p5_new~0=-128, ~p2_old~0=-128, ~p4_old~0=-128, ~p5_old~0=-128, ~p3_old~0=-128, ULTIMATE.start_node2_~m2~0=-128, ~p4_new~0=-128, ~p1_new~0=-128, ~p2_new~0=-128, ~p3_new~0=-128, ~p6_old~0=-128, ULTIMATE.start_node1_~m1~0=-128, ~send2~0=128, ULTIMATE.start_node6_~m6~0=-128, ~send4~0=128, ULTIMATE.start_node3_~m3~0=-128} 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-01-14 04:49:04,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:49:04,205 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-01-14 04:49:04,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:49:04,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:49:04,378 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:49:04,380 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:49:04,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:49:04,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:49:04,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:49:04,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:49:04,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:49:04,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:49:04,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:49:04,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:49:04,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:49:04,383 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:49:04,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-01-14 04:49:04,554 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8932 disjunctions. This might take some time... [2019-01-14 04:49:04,754 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 60 disjunctions. [2019-01-14 04:49:04,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:04,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-01-14 04:49:04,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-01-14 04:49:04,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-01-14 04:49:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:04,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-01-14 04:49:04,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,238 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 04:49:05,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:05,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:06,011 WARN L181 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-14 04:49:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:06,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:49:06,758 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-01-14 04:49:06,768 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-14 04:50:08,551 WARN L181 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 647 DAG size of output: 199 [2019-01-14 04:50:08,607 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:50:08,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:50:08,617 INFO L122 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-01-14 04:50:08,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,630 INFO L122 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-01-14 04:50:08,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,636 INFO L122 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-01-14 04:50:08,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,644 INFO L122 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-01-14 04:50:08,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,649 INFO L122 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-01-14 04:50:08,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,655 INFO L122 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-01-14 04:50:08,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,661 INFO L122 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-01-14 04:50:08,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:50:08,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:50:08,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,670 INFO L122 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-01-14 04:50:08,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,678 INFO L122 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-01-14 04:50:08,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,686 INFO L122 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-01-14 04:50:08,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,695 INFO L122 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-01-14 04:50:08,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,704 INFO L122 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-01-14 04:50:08,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,714 INFO L122 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-01-14 04:50:08,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,720 INFO L122 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-01-14 04:50:08,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,731 INFO L122 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-01-14 04:50:08,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:50:08,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:50:08,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,742 INFO L122 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-01-14 04:50:08,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,750 INFO L122 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-01-14 04:50:08,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:50:08,761 INFO L122 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-01-14 04:50:08,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:50:08,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:50:08,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:50:08,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:50:08,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:50:08,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:50:08,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:50:08,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:50:08,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:50:08,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:50:08,775 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:50:08,776 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:50:08,776 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:50:08,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-01-14 04:50:08,781 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:50:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:50:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:50:09,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:50:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:50:09,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:50:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:50:09,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:50:09,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 04:50:09,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2019-01-14 04:50:09,526 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-01-14 04:50:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:50:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2019-01-14 04:50:09,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2019-01-14 04:50:09,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:50:09,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2019-01-14 04:50:09,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:50:09,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2019-01-14 04:50:09,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:50:09,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2019-01-14 04:50:09,548 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:50:09,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2019-01-14 04:50:09,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:50:09,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:50:09,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:50:09,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:50:09,549 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:50:09,549 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:50:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:50:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:50:09,552 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:50:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:50:09,552 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:50:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:50:09,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:50:09,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:50:09,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:50:09,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:50:09,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:50:09,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:50:09,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:50:09,553 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:50:09,554 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:50:09,554 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:50:09,554 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:50:09,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:50:09,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:50:09,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:50:09,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:50:09 BoogieIcfgContainer [2019-01-14 04:50:09,567 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:50:09,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:50:09,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:50:09,567 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:50:09,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:44" (3/4) ... [2019-01-14 04:50:09,574 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:50:09,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:50:09,576 INFO L168 Benchmark]: Toolchain (without parser) took 146998.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 947.3 MB in the beginning and 938.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,579 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:50:09,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,583 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,584 INFO L168 Benchmark]: RCFGBuilder took 1131.90 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,586 INFO L168 Benchmark]: BuchiAutomizer took 145178.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 151.3 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:50:09,588 INFO L168 Benchmark]: Witness Printer took 7.64 ms. Allocated memory is still 1.4 GB. Free memory is still 938.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:50:09,596 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.51 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1131.90 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 145178.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 151.3 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.64 ms. Allocated memory is still 1.4 GB. Free memory is still 938.2 MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 145.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 143.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital3298 mio100 ax102 hnf100 lsp6 ukn67 mio100 lsp100 div166 bol100 ite100 ukn100 eq170 hnf68 smp100 dnf40960 smp12 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...