./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash c0bce2603970e0a002a5b33cfd00ef3446011286 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:16:40,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:40,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:40,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:40,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:40,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:40,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:40,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:40,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:40,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:40,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:40,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:40,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:40,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:40,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:40,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:40,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:40,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:40,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:40,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:40,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:40,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:40,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:40,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:40,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:40,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:40,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:40,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:40,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:40,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:40,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:40,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:40,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:40,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:40,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:40,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:40,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:16:40,238 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:40,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:40,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:40,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:40,240 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:40,240 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:40,241 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:40,241 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:40,241 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:40,241 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:40,241 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:40,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:40,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:40,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:40,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:40,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:40,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:40,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:40,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:40,249 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:40,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:40,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:40,250 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:40,251 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:40,251 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0bce2603970e0a002a5b33cfd00ef3446011286 [2019-01-14 02:16:40,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:40,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:40,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:40,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:40,340 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:40,341 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:40,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fe1470e/20fc4cef8dd946c9a05467be5b599726/FLAGe98ad2c79 [2019-01-14 02:16:40,866 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:40,866 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:40,872 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fe1470e/20fc4cef8dd946c9a05467be5b599726/FLAGe98ad2c79 [2019-01-14 02:16:41,238 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fe1470e/20fc4cef8dd946c9a05467be5b599726 [2019-01-14 02:16:41,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:41,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:41,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:41,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:41,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:41,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbb653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41, skipping insertion in model container [2019-01-14 02:16:41,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:41,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:41,531 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:41,536 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:41,559 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:41,578 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41 WrapperNode [2019-01-14 02:16:41,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:41,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:41,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:41,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:41,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:41,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:41,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:41,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:41,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (1/1) ... [2019-01-14 02:16:41,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:41,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:41,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:41,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:41,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (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 02:16:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:41,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:42,140 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:42,141 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-14 02:16:42,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:42 BoogieIcfgContainer [2019-01-14 02:16:42,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:42,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:42,143 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:42,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:42,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:42,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:41" (1/3) ... [2019-01-14 02:16:42,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@778f3220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:42, skipping insertion in model container [2019-01-14 02:16:42,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:42,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:41" (2/3) ... [2019-01-14 02:16:42,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@778f3220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:42, skipping insertion in model container [2019-01-14 02:16:42,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:42,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:42" (3/3) ... [2019-01-14 02:16:42,151 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-14 02:16:42,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:42,219 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:42,219 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:42,219 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:42,220 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:42,220 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:42,220 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:42,220 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:42,221 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:42,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:16:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 02:16:42,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:42,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:42,265 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:42,265 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:42,265 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:42,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:16:42,267 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 02:16:42,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:42,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:42,269 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:42,269 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:42,277 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5; 10#L41true assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 6#L18true assume !(f_~k~0 > 1073741823); 13#L23-1true [2019-01-14 02:16:42,277 INFO L796 eck$LassoCheckResult]: Loop: 13#L23-1true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 13#L23-1true [2019-01-14 02:16:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-01-14 02:16:42,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2019-01-14 02:16:42,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 957453, now seen corresponding path program 1 times [2019-01-14 02:16:42,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:42,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:42,574 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:42,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:42,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:42,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:42,576 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:42,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:42,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:42,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:42,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-14 02:16:42,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:42,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:42,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 02:16:42,625 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 02:16:42,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 02:16:42,634 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 02:16:42,637 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 02:16:42,640 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 02:16:42,673 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 02:16:42,701 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 02:16:42,714 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 02:16:42,718 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 02:16:42,743 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 02:16:43,124 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:43,125 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 02:16:43,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,136 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,166 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,201 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,229 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,258 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,258 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:43,287 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:43,287 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:43,311 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:43,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:43,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:55,427 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:16:55,433 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:55,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:55,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:55,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:55,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:55,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:55,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:55,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:55,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-14 02:16:55,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:55,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:55,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 02:16:55,442 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 02:16:55,445 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 02:16:55,450 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 02:16:55,461 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 02:16:55,488 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 02:16:55,574 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 02:16:55,579 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 02:16:55,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 02:16:55,608 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 02:16:55,613 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 02:16:55,962 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:16:56,176 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 02:16:56,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:56,189 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:56,191 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 02:16:56,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:56,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:56,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:56,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:56,203 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 02:16:56,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:56,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:56,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:56,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:56,207 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 02:16:56,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:56,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:56,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:56,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:56,211 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 02:16:56,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:56,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:56,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:56,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:56,215 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 02:16:56,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:56,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:56,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:56,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:56,219 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 02:16:56,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:56,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:56,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:56,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:56,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:56,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:56,296 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:56,382 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:16:56,385 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:16:56,390 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:56,395 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:16:56,400 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:56,401 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-14 02:16:56,441 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:16:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:56,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:56,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:56,998 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 02:16:57,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:16:57,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:16:57,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 49 states and 76 transitions. Complement of second has 7 states. [2019-01-14 02:16:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2019-01-14 02:16:57,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:16:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:57,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:16:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:16:57,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:57,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 76 transitions. [2019-01-14 02:16:57,148 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-01-14 02:16:57,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 20 states and 28 transitions. [2019-01-14 02:16:57,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:16:57,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:16:57,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-01-14 02:16:57,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:57,155 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 02:16:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-01-14 02:16:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-01-14 02:16:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:16:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-01-14 02:16:57,185 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:16:57,185 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:16:57,185 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:57,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-01-14 02:16:57,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-14 02:16:57,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:57,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:57,187 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:16:57,187 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:57,187 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 115#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 120#L18-1 assume !(f_~k~0 > 1073741823); 121#L23-3 [2019-01-14 02:16:57,188 INFO L796 eck$LassoCheckResult]: Loop: 121#L23-3 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 121#L23-3 [2019-01-14 02:16:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 32101, now seen corresponding path program 1 times [2019-01-14 02:16:57,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times [2019-01-14 02:16:57,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 995187, now seen corresponding path program 1 times [2019-01-14 02:16:57,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:57,327 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:57,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:57,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:57,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:57,327 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:57,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:57,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:57,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-14 02:16:57,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:57,328 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:57,331 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 02:16:57,336 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 02:16:57,339 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 02:16:57,349 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 02:16:57,355 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 02:16:57,368 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 02:16:57,371 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 02:16:57,373 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 02:16:57,399 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 02:16:57,401 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 02:16:57,404 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 02:16:57,528 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:57,528 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,542 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,567 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,596 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,596 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,623 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,623 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,649 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,650 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~d=0, ULTIMATE.start_f_#in~d=0} Honda state: {ULTIMATE.start_f_~d=2, ULTIMATE.start_f_#in~d=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,705 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_~y~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,732 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:57,783 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:57,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:57,805 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:57,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:57,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:09,916 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:17:09,923 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:09,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:09,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:09,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:09,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:09,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:09,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:09,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:09,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-14 02:17:09,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:09,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:09,927 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 02:17:09,932 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 02:17:09,937 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 02:17:09,961 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 02:17:09,963 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 02:17:09,971 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 02:17:09,973 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 02:17:09,986 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 02:17:09,988 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 02:17:09,999 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 02:17:10,005 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 02:17:10,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:10,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:10,140 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 02:17:10,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:10,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:10,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:10,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:10,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:10,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:10,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:10,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:10,146 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 02:17:10,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:10,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:10,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:10,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:10,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:10,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:10,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:10,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:10,149 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 02:17:10,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:10,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:10,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:10,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:10,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:10,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:10,180 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:10,204 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:10,205 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:10,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:10,211 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:10,212 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:10,212 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-14 02:17:10,235 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:10,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:10,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:10,476 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 02:17:10,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:17:10,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:17:10,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2019-01-14 02:17:10,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 02:17:10,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:17:10,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:17:10,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:17:10,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:10,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-14 02:17:10,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-14 02:17:10,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2019-01-14 02:17:10,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:17:10,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:17:10,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-01-14 02:17:10,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:10,565 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:17:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-01-14 02:17:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2019-01-14 02:17:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:17:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-14 02:17:10,568 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-14 02:17:10,568 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-14 02:17:10,568 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:17:10,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2019-01-14 02:17:10,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:10,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:10,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:10,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:17:10,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:10,572 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 195#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 202#L18 assume !(f_~k~0 > 1073741823); 198#L23-1 assume !(f_~z~0 < f_~k~0); 196#L29-2 [2019-01-14 02:17:10,573 INFO L796 eck$LassoCheckResult]: Loop: 196#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 197#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 196#L29-2 [2019-01-14 02:17:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,573 INFO L82 PathProgramCache]: Analyzing trace with hash 957451, now seen corresponding path program 1 times [2019-01-14 02:17:10,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 1 times [2019-01-14 02:17:10,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:10,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:10,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:10,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 920111346, now seen corresponding path program 1 times [2019-01-14 02:17:10,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:10,696 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:10,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:10,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:10,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:10,697 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:10,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:10,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:10,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-14 02:17:10,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:10,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:10,700 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 02:17:10,707 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 02:17:10,709 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 02:17:10,716 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 02:17:10,719 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 02:17:10,722 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 02:17:10,727 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 02:17:10,742 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 02:17:10,748 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 02:17:10,751 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 02:17:10,844 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:10,844 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:10,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:10,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:10,882 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:10,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:10,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:10,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:17:10,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:10,940 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:10,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=-13, ULTIMATE.start_f_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:10,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:10,976 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:10,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:10,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:10,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:11,007 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:11,007 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:11,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:11,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:11,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:11,057 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:11,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:11,183 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:11,185 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:11,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:11,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:11,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:11,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:11,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:11,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:11,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-14 02:17:11,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:11,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:11,191 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 02:17:11,199 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 02:17:11,207 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 02:17:11,209 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 02:17:11,236 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 02:17:11,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 02:17:11,243 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 02:17:11,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 02:17:11,246 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 02:17:11,248 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 02:17:11,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:11,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:11,456 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 02:17:11,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:11,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:11,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:11,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:11,462 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 02:17:11,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:11,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:11,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:11,482 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 02:17:11,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:11,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:11,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:11,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:11,495 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 02:17:11,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:11,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:11,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:11,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:11,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:11,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:11,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:11,534 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:11,534 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:11,534 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:11,537 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:11,538 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:11,538 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 02:17:11,565 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:11,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:11,710 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 02:17:11,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:11,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:17:11,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2019-01-14 02:17:11,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:17:11,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:11,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:17:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:17:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:11,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2019-01-14 02:17:11,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:11,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 28 transitions. [2019-01-14 02:17:11,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:17:11,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:17:11,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-01-14 02:17:11,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:11,784 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 02:17:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-01-14 02:17:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 02:17:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:17:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-01-14 02:17:11,788 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:17:11,788 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-14 02:17:11,788 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:17:11,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-01-14 02:17:11,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:11,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:11,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:11,790 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:17:11,790 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:11,790 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 279#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 288#L18-1 assume !(f_~k~0 > 1073741823); 289#L23-3 assume !(f_~z~0 < f_~k~0); 277#L29-5 [2019-01-14 02:17:11,791 INFO L796 eck$LassoCheckResult]: Loop: 277#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 275#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 277#L29-5 [2019-01-14 02:17:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 995185, now seen corresponding path program 1 times [2019-01-14 02:17:11,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 1 times [2019-01-14 02:17:11,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 956374936, now seen corresponding path program 1 times [2019-01-14 02:17:11,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:11,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:11,933 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:11,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:11,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:11,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:11,934 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:11,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:11,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:11,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:11,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:17:11,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:11,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:11,937 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 02:17:11,942 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 02:17:11,944 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 02:17:11,978 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 02:17:11,987 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 02:17:12,000 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 02:17:12,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 02:17:12,025 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 02:17:12,027 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 02:17:12,029 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 02:17:12,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:12,163 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,195 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,195 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,221 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:12,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:12,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-13} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:12,300 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:17:12,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:12,347 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,421 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:12,423 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:12,423 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:12,423 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:12,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:12,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:12,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:12,424 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:12,424 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:17:12,424 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:12,424 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:12,427 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 02:17:12,432 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 02:17:12,436 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 02:17:12,440 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 02:17:12,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 02:17:12,456 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 02:17:12,461 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 02:17:12,463 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 02:17:12,468 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 02:17:12,470 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 02:17:12,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:12,583 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:12,583 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 02:17:12,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:12,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:12,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:12,596 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 02:17:12,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:12,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:12,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:12,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:12,604 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 02:17:12,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:12,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:12,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:12,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:12,612 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 02:17:12,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:12,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:12,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:12,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:12,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:12,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:12,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:12,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:12,662 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:17:12,663 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:12,668 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:12,668 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:12,668 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 02:17:12,683 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:12,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:12,774 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 02:17:12,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:12,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 02:17:12,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2019-01-14 02:17:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:17:12,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:17:12,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:12,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:17:12,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:12,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:17:12,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:12,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-14 02:17:12,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:12,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 34 transitions. [2019-01-14 02:17:12,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:17:12,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:17:12,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2019-01-14 02:17:12,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:12,863 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-01-14 02:17:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2019-01-14 02:17:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 02:17:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:17:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2019-01-14 02:17:12,868 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-14 02:17:12,869 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-14 02:17:12,869 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:17:12,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2019-01-14 02:17:12,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:17:12,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:12,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:12,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:17:12,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:12,873 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 372#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 383#L18 assume !(f_~k~0 > 1073741823); 378#L23-1 assume !(f_~z~0 < f_~k~0); 379#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 377#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 385#L30 [2019-01-14 02:17:12,874 INFO L796 eck$LassoCheckResult]: Loop: 385#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 373#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 374#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 385#L30 [2019-01-14 02:17:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,874 INFO L82 PathProgramCache]: Analyzing trace with hash 920111342, now seen corresponding path program 1 times [2019-01-14 02:17:12,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:12,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash 63396, now seen corresponding path program 1 times [2019-01-14 02:17:12,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:12,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash 555740055, now seen corresponding path program 1 times [2019-01-14 02:17:12,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:12,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:12,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:12,964 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:12,964 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:12,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:12,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:12,964 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:12,964 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:12,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:12,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:12,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:17:12,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:12,965 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:12,966 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 02:17:12,970 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 02:17:12,981 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 02:17:12,985 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 02:17:13,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:13,048 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,053 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:13,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,092 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,120 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,210 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,210 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 02:17:13,582 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-14 02:17:13,595 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:13,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:13,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:13,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:13,596 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:13,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:13,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:13,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-14 02:17:13,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:13,597 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:13,599 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 02:17:13,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 02:17:13,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 02:17:13,612 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 02:17:13,636 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 02:17:13,639 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 02:17:13,642 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 02:17:13,644 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 02:17:13,649 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 02:17:13,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:13,761 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0, ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,797 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,819 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:13,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:13,822 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:13,842 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:13,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:13,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:14,033 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:14,035 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:14,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:14,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:14,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:14,036 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:14,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:14,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:14,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:14,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-14 02:17:14,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:14,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:14,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 02:17:14,061 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 02:17:14,066 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 02:17:14,077 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 02:17:14,080 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 02:17:14,082 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 02:17:14,085 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 02:17:14,087 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 02:17:14,089 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 02:17:14,185 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:14,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:14,186 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 02:17:14,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:14,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:14,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:14,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:14,197 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 02:17:14,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:14,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,197 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:17:14,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:17:14,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:14,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:14,201 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 02:17:14,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:14,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:14,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:14,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:14,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:14,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:14,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:14,217 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:14,218 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:14,218 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:14,219 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:14,219 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:14,219 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 02:17:14,252 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:14,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:14,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:14,701 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 02:17:14,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:17:14,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-01-14 02:17:14,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 32 states and 46 transitions. Complement of second has 7 states. [2019-01-14 02:17:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-14 02:17:14,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:17:14,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:14,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:17:14,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:14,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:17:14,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:14,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 46 transitions. [2019-01-14 02:17:14,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:17:14,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 41 transitions. [2019-01-14 02:17:14,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:17:14,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:17:14,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2019-01-14 02:17:14,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:14,770 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-01-14 02:17:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2019-01-14 02:17:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-14 02:17:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:17:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-01-14 02:17:14,775 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-01-14 02:17:14,775 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-01-14 02:17:14,775 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:17:14,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2019-01-14 02:17:14,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:17:14,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:14,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:14,779 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:17:14,779 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:14,779 INFO L794 eck$LassoCheckResult]: Stem: 487#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 488#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 496#L18-1 assume !(f_~k~0 > 1073741823); 497#L23-3 assume !(f_~z~0 < f_~k~0); 505#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 483#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 484#L30-1 [2019-01-14 02:17:14,779 INFO L796 eck$LassoCheckResult]: Loop: 484#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 501#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 502#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 484#L30-1 [2019-01-14 02:17:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 956374932, now seen corresponding path program 1 times [2019-01-14 02:17:14,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 101130, now seen corresponding path program 1 times [2019-01-14 02:17:14,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:14,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371113, now seen corresponding path program 1 times [2019-01-14 02:17:14,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:14,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:14,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:14,942 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 02:17:14,957 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:14,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:14,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:14,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:14,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:14,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:14,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:14,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:14,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:17:14,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:14,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:14,960 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 02:17:14,965 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 02:17:14,968 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 02:17:14,975 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 02:17:15,107 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-14 02:17:15,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:15,140 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,168 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:15,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,268 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 02:17:15,591 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-14 02:17:15,605 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:15,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:15,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:15,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:15,606 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:15,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:15,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:15,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-14 02:17:15,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:15,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:15,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 02:17:15,618 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 02:17:15,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 02:17:15,626 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 02:17:15,628 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 02:17:15,630 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 02:17:15,631 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 02:17:15,634 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 02:17:15,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 02:17:15,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:15,740 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,746 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:15,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-2} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0}, {ULTIMATE.start_f_~z~0=-8, ULTIMATE.start_f_~k~0=6}, {ULTIMATE.start_f_~z~0=7, ULTIMATE.start_f_~k~0=-6}] Lambdas: [15, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0, ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_~y~0=4, ULTIMATE.start_f_#t~nondet4=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,863 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,863 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,888 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:17:15,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,934 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,940 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,940 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,965 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,965 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-1} Honda state: {ULTIMATE.start_f_#t~nondet3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:15,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:15,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:15,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:15,989 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:16,013 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:16,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:16,208 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:16,209 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:16,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:16,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:16,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:16,210 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:16,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:16,210 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:16,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:16,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-14 02:17:16,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:16,211 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:16,214 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 02:17:16,234 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 02:17:16,242 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 02:17:16,248 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 02:17:16,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 02:17:16,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 02:17:16,254 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 02:17:16,255 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 02:17:16,258 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 02:17:16,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:16,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:16,386 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 02:17:16,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:16,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:16,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:16,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:16,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:16,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:16,408 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:16,414 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:16,415 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:17:16,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:16,419 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:16,420 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:16,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 02:17:16,453 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:16,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:16,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:16,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:17:16,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-01-14 02:17:16,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 37 states and 53 transitions. Complement of second has 7 states. [2019-01-14 02:17:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-14 02:17:16,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:17:16,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:17:16,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:17:16,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:16,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 53 transitions. [2019-01-14 02:17:16,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:16,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 48 transitions. [2019-01-14 02:17:16,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:17:16,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:17:16,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2019-01-14 02:17:16,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:16,792 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-01-14 02:17:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2019-01-14 02:17:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-14 02:17:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 02:17:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-01-14 02:17:16,797 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-01-14 02:17:16,797 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-01-14 02:17:16,797 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:17:16,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2019-01-14 02:17:16,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:16,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:16,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:16,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:16,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:16,799 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 615#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 625#L18 assume !(f_~k~0 > 1073741823); 620#L23-1 assume !(f_~z~0 < f_~k~0); 621#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 636#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 631#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 632#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 638#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 616#L29-2 [2019-01-14 02:17:16,800 INFO L796 eck$LassoCheckResult]: Loop: 616#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 617#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 616#L29-2 [2019-01-14 02:17:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash 555740059, now seen corresponding path program 1 times [2019-01-14 02:17:16,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:16,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 2 times [2019-01-14 02:17:16,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1490252930, now seen corresponding path program 2 times [2019-01-14 02:17:16,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:16,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:16,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:16,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:17,156 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 02:17:17,309 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:17:17,319 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:17,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:17,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:17,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:17,320 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:17,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:17,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:17,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-14 02:17:17,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:17,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:17,325 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 02:17:17,371 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 02:17:17,535 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 02:17:17,563 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 02:17:17,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 02:17:17,567 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 02:17:17,574 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 02:17:17,576 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 02:17:17,577 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 02:17:17,580 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 02:17:17,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 02:17:17,653 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:17,654 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:17,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:17,679 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:17,679 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:17,684 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:17,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:17,783 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:17,785 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:17,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:17,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:17,785 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:17,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:17,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:17,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:17,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:17,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-14 02:17:17,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:17,786 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:17,788 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 02:17:17,795 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 02:17:17,798 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 02:17:17,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:17,800 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 02:17:17,803 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 02:17:17,827 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 02:17:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:17,831 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 02:17:17,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:17,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:17,923 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:17,923 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:17,924 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 02:17:17,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:17,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:17,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,929 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 02:17:17,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:17,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:17,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,933 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 02:17:17,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,936 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 02:17:17,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,938 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 02:17:17,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,940 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 02:17:17,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,942 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 02:17:17,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:17,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:17,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,945 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 02:17:17,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,947 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 02:17:17,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:17,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:17,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:17,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:17,949 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 02:17:17,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:17,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:17,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:17,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:17,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:17,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:17,958 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:17,966 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:17:17,966 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:17:17,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:17,967 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:17,967 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:17,967 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 02:17:18,008 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:18,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:18,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:18,208 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 02:17:18,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:18,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-01-14 02:17:18,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 50 states and 69 transitions. Complement of second has 6 states. [2019-01-14 02:17:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 02:17:18,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:17:18,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:18,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:18,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:18,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:17:18,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:18,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. [2019-01-14 02:17:18,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:18,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 59 transitions. [2019-01-14 02:17:18,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:17:18,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 02:17:18,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2019-01-14 02:17:18,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:18,264 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-01-14 02:17:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2019-01-14 02:17:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-14 02:17:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:17:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2019-01-14 02:17:18,273 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2019-01-14 02:17:18,273 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2019-01-14 02:17:18,273 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:17:18,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2019-01-14 02:17:18,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:18,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:18,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:18,277 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:18,277 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:18,277 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 761#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 769#L18-1 assume !(f_~k~0 > 1073741823); 770#L23-3 assume !(f_~z~0 < f_~k~0); 784#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 786#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 776#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 777#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 787#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 757#L29-5 [2019-01-14 02:17:18,278 INFO L796 eck$LassoCheckResult]: Loop: 757#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 756#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 757#L29-5 [2019-01-14 02:17:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:18,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371109, now seen corresponding path program 1 times [2019-01-14 02:17:18,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:18,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 2 times [2019-01-14 02:17:18,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 645770306, now seen corresponding path program 2 times [2019-01-14 02:17:18,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:18,484 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 02:17:18,498 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:18,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:18,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:18,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:18,498 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:18,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:18,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:18,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:18,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Lasso [2019-01-14 02:17:18,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:18,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:18,502 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 02:17:18,512 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 02:17:18,526 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 02:17:18,534 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 02:17:18,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 02:17:18,540 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 02:17:18,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 02:17:18,546 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 02:17:18,547 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 02:17:18,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 02:17:18,551 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 02:17:18,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:18,628 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:18,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:18,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:18,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:18,638 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:18,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:18,661 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:18,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:18,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:18,774 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:18,777 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:18,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:18,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:18,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:18,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:18,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:18,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:18,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:18,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Lasso [2019-01-14 02:17:18,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:18,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:18,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:18,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 02:17:18,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:18,809 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 02:17:18,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:18,816 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 02:17:18,818 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 02:17:18,819 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 02:17:18,821 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 02:17:18,823 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 02:17:18,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:18,937 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:18,938 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 02:17:18,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:18,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:18,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:18,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:18,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:18,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:18,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:18,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:18,941 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 02:17:18,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:18,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:18,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:18,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:18,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:18,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:18,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:18,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:18,954 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:17:18,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:18,957 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:18,957 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:18,957 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 02:17:18,983 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:19,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:19,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:19,150 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 02:17:19,151 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:19,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27 Second operand 4 states. [2019-01-14 02:17:19,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 58 states and 79 transitions. Complement of second has 6 states. [2019-01-14 02:17:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 02:17:19,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:17:19,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:17:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:19,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 79 transitions. [2019-01-14 02:17:19,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:19,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 50 states and 69 transitions. [2019-01-14 02:17:19,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:17:19,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:17:19,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 69 transitions. [2019-01-14 02:17:19,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:19,199 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2019-01-14 02:17:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 69 transitions. [2019-01-14 02:17:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 02:17:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 02:17:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-01-14 02:17:19,206 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-01-14 02:17:19,206 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-01-14 02:17:19,206 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:17:19,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. [2019-01-14 02:17:19,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:17:19,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:19,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:19,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:19,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:19,208 INFO L794 eck$LassoCheckResult]: Stem: 923#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 924#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 934#L18 assume !(f_~k~0 > 1073741823); 930#L23-1 assume !(f_~z~0 < f_~k~0); 925#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 926#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 958#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 951#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 952#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 956#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 955#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 936#L29-2 [2019-01-14 02:17:19,208 INFO L796 eck$LassoCheckResult]: Loop: 936#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 935#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 936#L29-2 [2019-01-14 02:17:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1600239380, now seen corresponding path program 3 times [2019-01-14 02:17:19,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 3 times [2019-01-14 02:17:19,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:19,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 231753147, now seen corresponding path program 4 times [2019-01-14 02:17:19,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:19,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:19,414 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:19,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:19,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:19,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:19,415 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:19,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:19,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:19,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Lasso [2019-01-14 02:17:19,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:19,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:19,418 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 02:17:19,434 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 02:17:19,438 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 02:17:19,440 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 02:17:19,442 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 02:17:19,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 02:17:19,445 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 02:17:19,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 02:17:19,453 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 02:17:19,455 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 02:17:19,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 02:17:19,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:19,556 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,589 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,589 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,616 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,669 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,747 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:17:19,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,770 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,774 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:19,774 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:19,796 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:19,821 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:19,912 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:19,914 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:19,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:19,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:19,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:19,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:19,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:19,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:19,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:19,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration9_Lasso [2019-01-14 02:17:19,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:19,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:19,917 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 02:17:19,930 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 02:17:19,932 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 02:17:19,938 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 02:17:19,945 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 02:17:19,947 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 02:17:19,949 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 02:17:19,956 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 02:17:19,963 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 02:17:19,984 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 02:17:20,001 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 02:17:20,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:20,102 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:20,102 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 02:17:20,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,106 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 02:17:20,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,109 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 02:17:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,112 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 02:17:20,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:20,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:20,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,118 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 02:17:20,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,123 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 02:17:20,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,127 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 02:17:20,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,130 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 02:17:20,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:20,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:20,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,136 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 02:17:20,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:20,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:20,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:20,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:20,139 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 02:17:20,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:20,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:20,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:20,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:20,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:20,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:20,152 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:20,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:20,167 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:17:20,171 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:20,173 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:20,173 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:20,173 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-14 02:17:20,214 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:20,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:20,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:20,884 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 02:17:20,885 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:20,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 02:17:20,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2019-01-14 02:17:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 02:17:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:20,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:21,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:21,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:21,036 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 02:17:21,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:21,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 02:17:21,071 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2019-01-14 02:17:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 02:17:21,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:21,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:21,077 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:21,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:21,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:21,141 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 02:17:21,142 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:21,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2019-01-14 02:17:21,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 59 states and 80 transitions. Complement of second has 5 states. [2019-01-14 02:17:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 02:17:21,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:21,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:21,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 02:17:21,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:21,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:17:21,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:21,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 80 transitions. [2019-01-14 02:17:21,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:21,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 25 states and 34 transitions. [2019-01-14 02:17:21,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:17:21,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:17:21,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-14 02:17:21,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:21,200 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 02:17:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-14 02:17:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 02:17:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:17:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-14 02:17:21,202 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 02:17:21,202 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 02:17:21,202 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:17:21,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-01-14 02:17:21,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:17:21,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:21,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:21,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:21,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:17:21,204 INFO L794 eck$LassoCheckResult]: Stem: 1310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 1311#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1312#L18-1 assume !(f_~k~0 > 1073741823); 1313#L23-3 assume !(f_~z~0 < f_~k~0); 1316#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1317#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1329#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1328#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 1326#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1325#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1321#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1323#L29-5 [2019-01-14 02:17:21,205 INFO L796 eck$LassoCheckResult]: Loop: 1323#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1324#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1323#L29-5 [2019-01-14 02:17:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash 755756756, now seen corresponding path program 3 times [2019-01-14 02:17:21,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:21,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 3 times [2019-01-14 02:17:21,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:21,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:21,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:21,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 432771643, now seen corresponding path program 4 times [2019-01-14 02:17:21,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:21,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:21,426 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:21,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:21,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:21,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:21,427 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:17:21,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:21,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:21,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Lasso [2019-01-14 02:17:21,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:21,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:21,430 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 02:17:21,459 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 02:17:21,462 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 02:17:21,468 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 02:17:21,470 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 02:17:21,480 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 02:17:21,483 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 02:17:21,485 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 02:17:21,487 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 02:17:21,498 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 02:17:21,500 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 02:17:21,588 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:21,590 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:21,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:21,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:21,629 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:21,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:21,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:21,641 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:21,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:21,688 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:21,688 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:21,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:21,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:17:21,698 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:17:21,722 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:17:21,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:17:21,843 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:17:21,845 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:21,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:21,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:21,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:21,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:21,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:21,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:21,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:21,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration10_Lasso [2019-01-14 02:17:21,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:21,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:21,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:21,863 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 02:17:21,888 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 02:17:21,893 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 02:17:21,894 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 02:17:21,911 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 02:17:21,914 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 02:17:21,916 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 02:17:21,919 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 02:17:21,921 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 02:17:21,923 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 02:17:22,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:22,051 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:22,054 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 02:17:22,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:22,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:22,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:22,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:22,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:22,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:22,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:22,063 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 02:17:22,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:22,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:22,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:22,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:22,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:22,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:22,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:22,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:22,067 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 02:17:22,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:22,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:22,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:22,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:22,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:22,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:22,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:22,080 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 02:17:22,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:22,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:22,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:22,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:22,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:22,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:22,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:22,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:22,082 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 02:17:22,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:22,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:22,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:22,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:22,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:22,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:22,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:22,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:17:22,110 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:17:22,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:22,116 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:17:22,117 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:22,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-14 02:17:22,153 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:17:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,528 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 02:17:22,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:22,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:17:22,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2019-01-14 02:17:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:17:22,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:22,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:22,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,629 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 02:17:22,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:22,630 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:17:22,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2019-01-14 02:17:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:17:22,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:22,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:22,659 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:22,710 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 02:17:22,710 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:17:22,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:17:22,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 36 states and 47 transitions. Complement of second has 5 states. [2019-01-14 02:17:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:17:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:17:22,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:17:22,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:22,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 02:17:22,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:22,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:17:22,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:22,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-01-14 02:17:22,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:22,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-01-14 02:17:22,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:22,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:22,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:22,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:22,748 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:22,748 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:22,748 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:22,748 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:17:22,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:17:22,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:22,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:17:22,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:17:22 BoogieIcfgContainer [2019-01-14 02:17:22,758 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:17:22,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:17:22,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:17:22,760 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:17:22,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:42" (3/4) ... [2019-01-14 02:17:22,764 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:17:22,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:17:22,766 INFO L168 Benchmark]: Toolchain (without parser) took 41524.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:22,768 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:22,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.79 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:22,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:22,769 INFO L168 Benchmark]: Boogie Preprocessor took 41.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:22,769 INFO L168 Benchmark]: RCFGBuilder took 469.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:22,772 INFO L168 Benchmark]: BuchiAutomizer took 40615.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.9 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:22,772 INFO L168 Benchmark]: Witness Printer took 5.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:22,785 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.79 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 469.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40615.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.9 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (0 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * z + k and consists of 5 locations. One deterministic module has affine ranking function -1 * z + k and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.5s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 36.3s. Construction of modules took 0.3s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 8. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 182 SDtfs, 246 SDslu, 59 SDs, 0 SdLazy, 137 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax100 hnf93 lsp56 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf91 smp100 dnf100 smp100 tf101 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 181ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 58 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 26.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...