./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/AlternKonv_false-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-restricted-15/AlternKonv_false-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 475cf88887990488194ca7f61a6d05f74a450e7b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:22:02,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:22:02,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:22:02,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:22:02,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:22:02,089 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:22:02,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:22:02,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:22:02,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:22:02,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:22:02,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:22:02,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:22:02,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:22:02,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:22:02,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:22:02,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:22:02,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:22:02,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:22:02,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:22:02,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:22:02,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:22:02,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:22:02,117 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:22:02,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:22:02,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:22:02,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:22:02,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:22:02,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:22:02,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:22:02,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:22:02,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:22:02,124 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:22:02,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:22:02,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:22:02,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:22:02,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:22:02,128 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:22:02,156 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:22:02,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:22:02,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:22:02,159 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:22:02,159 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:22:02,159 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:22:02,159 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:22:02,159 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:22:02,160 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:22:02,161 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:22:02,161 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:22:02,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:22:02,161 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:22:02,161 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:22:02,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:22:02,162 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:22:02,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:22:02,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:22:02,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:22:02,165 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:22:02,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:22:02,165 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:22:02,166 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:22:02,167 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:22:02,167 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 -> 475cf88887990488194ca7f61a6d05f74a450e7b [2019-01-14 02:22:02,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:22:02,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:22:02,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:22:02,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:22:02,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:22:02,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c [2019-01-14 02:22:02,308 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8931bb8cf/6994b6d6eb9645d685fc16ffc108ca53/FLAG15eb47f7c [2019-01-14 02:22:02,718 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:22:02,718 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c [2019-01-14 02:22:02,724 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8931bb8cf/6994b6d6eb9645d685fc16ffc108ca53/FLAG15eb47f7c [2019-01-14 02:22:03,092 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8931bb8cf/6994b6d6eb9645d685fc16ffc108ca53 [2019-01-14 02:22:03,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:22:03,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:22:03,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:03,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:22:03,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:22:03,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03, skipping insertion in model container [2019-01-14 02:22:03,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:22:03,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:22:03,357 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:03,364 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:22:03,387 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:22:03,405 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:22:03,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03 WrapperNode [2019-01-14 02:22:03,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:22:03,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:03,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:22:03,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:22:03,417 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:22:03" (1/1) ... [2019-01-14 02:22:03,423 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:22:03" (1/1) ... [2019-01-14 02:22:03,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:22:03,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:22:03,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:22:03,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:22:03,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (1/1) ... [2019-01-14 02:22:03,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:22:03,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:22:03,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:22:03,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:22:03,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (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:22:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:22:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:22:03,972 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:22:03,972 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:22:03,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:03 BoogieIcfgContainer [2019-01-14 02:22:03,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:22:03,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:22:03,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:22:03,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:22:03,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:03,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:22:03" (1/3) ... [2019-01-14 02:22:03,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4331c251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:03, skipping insertion in model container [2019-01-14 02:22:03,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:03,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:22:03" (2/3) ... [2019-01-14 02:22:03,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4331c251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:22:03, skipping insertion in model container [2019-01-14 02:22:03,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:22:03,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:03" (3/3) ... [2019-01-14 02:22:03,984 INFO L375 chiAutomizerObserver]: Analyzing ICFG AlternKonv_false-termination_true-no-overflow.c [2019-01-14 02:22:04,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:22:04,087 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:22:04,087 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:22:04,088 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:22:04,088 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:22:04,088 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:22:04,088 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:22:04,088 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:22:04,089 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:22:04,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:22:04,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:22:04,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:04,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:04,156 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:04,156 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:04,156 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:22:04,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:22:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:22:04,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:04,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:04,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:04,158 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:04,167 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L18-2true [2019-01-14 02:22:04,167 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(0 != main_~i~0); 3#L10true assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 6#L12true assume !(main_~i~0 < 0); 5#L18-2true [2019-01-14 02:22:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:22:04,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 39827, now seen corresponding path program 1 times [2019-01-14 02:22:04,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:04,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 963348, now seen corresponding path program 1 times [2019-01-14 02:22:04,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,429 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:04,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:04,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:04,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:04,431 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:04,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:04,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:04,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:22:04,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:04,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:04,457 INFO L141 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:22:04,473 INFO L141 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:22:04,479 INFO L141 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:22:04,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:04,621 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:22:04,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:04,666 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:22:04,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,676 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:04,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=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:22:04,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,716 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:22:04,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:04,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,765 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:04,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:04,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:04,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:04,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:04,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:04,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:04,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:04,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:22:04,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:04,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:04,772 INFO L141 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:22:04,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:05,150 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:05,151 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:22:05,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:05,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:05,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:05,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:05,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:05,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:05,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:05,173 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:22:05,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:05,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:05,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:05,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:05,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:05,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:05,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:05,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:22:05,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:05,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:05,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:05,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:05,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:05,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:05,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:05,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:05,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:05,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:22:05,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:05,213 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:05,213 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:05,213 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:05,215 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,357 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:22:05,371 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:22:05,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-01-14 02:22:05,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 32 states and 45 transitions. Complement of second has 6 states. [2019-01-14 02:22:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:22:05,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:22:05,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:22:05,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:22:05,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-01-14 02:22:05,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:22:05,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 14 states and 20 transitions. [2019-01-14 02:22:05,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:22:05,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:22:05,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:05,562 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 02:22:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:22:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2019-01-14 02:22:05,600 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-01-14 02:22:05,601 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-01-14 02:22:05,601 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:22:05,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2019-01-14 02:22:05,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:22:05,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:05,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:05,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:05,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:05,605 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 86#L18-2 assume !!(0 != main_~i~0); 79#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 80#L18 [2019-01-14 02:22:05,605 INFO L796 eck$LassoCheckResult]: Loop: 80#L18 assume main_~i~0 > 0;main_~i~0 := -1 * main_~i~0; 89#L18-2 assume !!(0 != main_~i~0); 90#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 80#L18 [2019-01-14 02:22:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 1 times [2019-01-14 02:22:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash 57996, now seen corresponding path program 1 times [2019-01-14 02:22:05,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:05,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,714 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:22:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:05,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:22:05,718 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:05,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:22:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:22:05,722 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:22:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:05,756 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2019-01-14 02:22:05,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:22:05,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:22:05,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 02:22:05,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:22:05,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:22:05,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:05,761 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 02:22:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:22:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 02:22:05,763 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,764 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,764 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:22:05,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:22:05,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:05,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:05,766 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:05,766 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:05,766 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 116#L18-2 assume !!(0 != main_~i~0); 111#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 112#L18 [2019-01-14 02:22:05,767 INFO L796 eck$LassoCheckResult]: Loop: 112#L18 assume !(main_~i~0 > 0); 122#L18-2 assume !!(0 != main_~i~0); 124#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 112#L18 [2019-01-14 02:22:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 2 times [2019-01-14 02:22:05,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash 59918, now seen corresponding path program 1 times [2019-01-14 02:22:05,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,812 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:22:05,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:05,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:22:05,813 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:22:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:22:05,814 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:22:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:05,853 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-01-14 02:22:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:22:05,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-14 02:22:05,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:22:05,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:22:05,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:22:05,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:22:05,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-14 02:22:05,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:05,858 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:22:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-14 02:22:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-14 02:22:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:22:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 02:22:05,862 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,862 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 02:22:05,862 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:22:05,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-14 02:22:05,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:22:05,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:05,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:05,864 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:22:05,864 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2019-01-14 02:22:05,864 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 153#L18-2 assume !!(0 != main_~i~0); 148#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 149#L18 [2019-01-14 02:22:05,864 INFO L796 eck$LassoCheckResult]: Loop: 149#L18 assume main_~i~0 > 0;main_~i~0 := -1 * main_~i~0; 154#L18-2 assume !!(0 != main_~i~0); 155#L10 assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 157#L12 assume !(main_~i~0 < 0); 159#L18-2 assume !!(0 != main_~i~0); 161#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 149#L18 [2019-01-14 02:22:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 3 times [2019-01-14 02:22:05,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1727393992, now seen corresponding path program 1 times [2019-01-14 02:22:05,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 684415735, now seen corresponding path program 1 times [2019-01-14 02:22:05,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:05,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:05,996 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:05,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:05,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:05,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:05,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:05,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:05,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:05,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:05,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:22:05,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:05,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:06,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:22:06,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:22:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:06,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:06,200 INFO L412 LassoAnalysis]: Checking for nontermination... 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:22:06,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:06,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:06,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:06,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=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:22:06,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:06,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:06,252 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:06,252 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} 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:22:06,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:06,257 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:22:06,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:06,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:06,308 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:06,327 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:06,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:06,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:06,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:06,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:06,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:06,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:06,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:06,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:22:06,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:06,328 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:06,333 INFO L141 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:22:06,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:22:06,356 INFO L141 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:22:06,495 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-14 02:22:06,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:06,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:06,633 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:22:06,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:06,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:06,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:06,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:06,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:06,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:06,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:06,645 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:22:06,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:06,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:06,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:06,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:06,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:06,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:06,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:06,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:06,658 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:22:06,658 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:06,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:06,659 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:06,659 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:06,660 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:06,661 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:06,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:07,032 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:22:07,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:22:07,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 25 states and 35 transitions. Complement of second has 5 states. [2019-01-14 02:22:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-14 02:22:07,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:22:07,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:07,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:22:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:07,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:07,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:07,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:22:07,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:22:07,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 43 states and 63 transitions. Complement of second has 9 states. [2019-01-14 02:22:07,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:22:07,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:22:07,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:07,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:22:07,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:07,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-14 02:22:07,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:07,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 63 transitions. [2019-01-14 02:22:07,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-01-14 02:22:07,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 60 transitions. [2019-01-14 02:22:07,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 02:22:07,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:22:07,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2019-01-14 02:22:07,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:07,272 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-01-14 02:22:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2019-01-14 02:22:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-01-14 02:22:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 02:22:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2019-01-14 02:22:07,278 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2019-01-14 02:22:07,278 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2019-01-14 02:22:07,278 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:22:07,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 55 transitions. [2019-01-14 02:22:07,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2019-01-14 02:22:07,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:07,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:07,280 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:22:07,280 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:22:07,280 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 324#L18-2 assume !!(0 != main_~i~0); 321#L10 assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 322#L12 assume main_~i~0 < 0; 328#L13 [2019-01-14 02:22:07,281 INFO L796 eck$LassoCheckResult]: Loop: 328#L13 assume !(main_~i~0 <= -2147483648);main_~i~0 := -1 * main_~i~0; 334#L18-2 assume !!(0 != main_~i~0); 354#L10 assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 352#L12 assume main_~i~0 < 0; 328#L13 [2019-01-14 02:22:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2019-01-14 02:22:07,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:07,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1559161, now seen corresponding path program 1 times [2019-01-14 02:22:07,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:07,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 608049029, now seen corresponding path program 1 times [2019-01-14 02:22:07,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:07,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:22:07,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:22:07,403 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:07,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:07,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:07,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:07,403 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:07,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:07,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:07,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:07,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:22:07,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:07,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:07,406 INFO L141 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:22:07,412 INFO L141 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:22:07,423 INFO L141 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:22:07,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:07,490 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) [2019-01-14 02:22:07,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:07,501 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:07,527 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:07,527 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} 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:22:07,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:07,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:07,555 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:07,556 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=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:22:07,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:07,561 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:22:07,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:07,590 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:07,656 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:07,658 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:07,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:07,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:07,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:07,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:07,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:07,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:07,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:07,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:22:07,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:07,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:07,662 INFO L141 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:22:07,678 INFO L141 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:22:07,686 INFO L141 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:22:07,775 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:07,775 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:07,775 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:22:07,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:07,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:07,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:07,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:07,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:07,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:07,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:07,787 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:22:07,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:07,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:07,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:07,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:07,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:07,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:07,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:07,795 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:22:07,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:07,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:07,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:07,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:07,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:07,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:07,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:07,804 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:07,807 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:07,807 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:22:07,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:07,807 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:07,808 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:07,808 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:07,808 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:07,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:07,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:07,928 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:22:07,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:22:07,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 55 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-01-14 02:22:08,053 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 55 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 147 states and 212 transitions. Complement of second has 11 states. [2019-01-14 02:22:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2019-01-14 02:22:08,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:22:08,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:22:08,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 02:22:08,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 212 transitions. [2019-01-14 02:22:08,064 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-01-14 02:22:08,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 121 states and 178 transitions. [2019-01-14 02:22:08,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 02:22:08,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-14 02:22:08,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 178 transitions. [2019-01-14 02:22:08,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:08,068 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 178 transitions. [2019-01-14 02:22:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 178 transitions. [2019-01-14 02:22:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-01-14 02:22:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 02:22:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2019-01-14 02:22:08,079 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 153 transitions. [2019-01-14 02:22:08,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:22:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:22:08,079 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand 4 states. [2019-01-14 02:22:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:08,164 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2019-01-14 02:22:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:22:08,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 105 transitions. [2019-01-14 02:22:08,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2019-01-14 02:22:08,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 72 states and 97 transitions. [2019-01-14 02:22:08,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-14 02:22:08,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-14 02:22:08,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2019-01-14 02:22:08,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:08,170 INFO L706 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2019-01-14 02:22:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2019-01-14 02:22:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2019-01-14 02:22:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:22:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-01-14 02:22:08,175 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:22:08,175 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:22:08,175 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:22:08,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-01-14 02:22:08,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-14 02:22:08,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:08,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:08,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:22:08,177 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:22:08,177 INFO L794 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 747#L18-2 assume !!(0 != main_~i~0); 766#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 768#L18 assume main_~i~0 > 0;main_~i~0 := -1 * main_~i~0; 753#L18-2 [2019-01-14 02:22:08,177 INFO L796 eck$LassoCheckResult]: Loop: 753#L18-2 assume !!(0 != main_~i~0); 773#L10 assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 751#L12 assume !(main_~i~0 < 0); 753#L18-2 [2019-01-14 02:22:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash 963757, now seen corresponding path program 1 times [2019-01-14 02:22:08,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 39827, now seen corresponding path program 2 times [2019-01-14 02:22:08,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1353476249, now seen corresponding path program 2 times [2019-01-14 02:22:08,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,264 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:08,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:08,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:08,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:08,264 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:08,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:08,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:08,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:08,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:22:08,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:08,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:08,267 INFO L141 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:22:08,277 INFO L141 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:22:08,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:08,364 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:08,364 INFO L412 LassoAnalysis]: Checking for nontermination... 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:22:08,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:08,368 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:22:08,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:08,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:08,414 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:08,416 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:08,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:08,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:08,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:08,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:08,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:08,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:08,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:08,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:22:08,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:08,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:08,419 INFO L141 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:22:08,435 INFO L141 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:22:08,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:22:08,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:08,519 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:08,519 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:22:08,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:08,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:08,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:08,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:08,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:08,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:08,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:08,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:08,526 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:22:08,527 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:08,527 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:08,527 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:08,527 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:08,528 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:22:08,528 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:08,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:08,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:08,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:08,620 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:22:08,621 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:22:08,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-01-14 02:22:08,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 73 states and 96 transitions. Complement of second has 5 states. [2019-01-14 02:22:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:22:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 02:22:08,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:22:08,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:22:08,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:22:08,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:08,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2019-01-14 02:22:08,657 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-14 02:22:08,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 88 transitions. [2019-01-14 02:22:08,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:22:08,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-14 02:22:08,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 88 transitions. [2019-01-14 02:22:08,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:08,660 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 88 transitions. [2019-01-14 02:22:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 88 transitions. [2019-01-14 02:22:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-14 02:22:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 02:22:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-01-14 02:22:08,666 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-01-14 02:22:08,666 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-01-14 02:22:08,666 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:22:08,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 80 transitions. [2019-01-14 02:22:08,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-14 02:22:08,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:08,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:08,670 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:22:08,670 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2019-01-14 02:22:08,670 INFO L794 eck$LassoCheckResult]: Stem: 896#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 897#L18-2 assume !!(0 != main_~i~0); 927#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 925#L18 assume !(main_~i~0 > 0); 908#L18-2 [2019-01-14 02:22:08,670 INFO L796 eck$LassoCheckResult]: Loop: 908#L18-2 assume !!(0 != main_~i~0); 948#L10 assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; 936#L12 assume !(main_~i~0 < 0); 947#L18-2 assume !!(0 != main_~i~0); 935#L10 assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; 893#L18 assume !(main_~i~0 > 0); 908#L18-2 [2019-01-14 02:22:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash 963759, now seen corresponding path program 1 times [2019-01-14 02:22:08,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:08,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1186496604, now seen corresponding path program 1 times [2019-01-14 02:22:08,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1517058698, now seen corresponding path program 1 times [2019-01-14 02:22:08,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:08,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:22:08 BoogieIcfgContainer [2019-01-14 02:22:08,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:22:08,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:22:08,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:22:08,867 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:22:08,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:22:03" (3/4) ... [2019-01-14 02:22:08,872 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:22:08,923 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:22:08,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:22:08,924 INFO L168 Benchmark]: Toolchain (without parser) took 5828.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.7 MB). Free memory was 951.4 MB in the beginning and 713.3 MB in the end (delta: 238.1 MB). Peak memory consumption was 295.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:08,927 INFO L168 Benchmark]: CDTParser took 0.16 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:22:08,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:22:08,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:08,930 INFO L168 Benchmark]: Boogie Preprocessor took 29.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:08,932 INFO L168 Benchmark]: RCFGBuilder took 493.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.7 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:08,933 INFO L168 Benchmark]: BuchiAutomizer took 4890.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 720.4 MB in the end (delta: 310.2 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:08,934 INFO L168 Benchmark]: Witness Printer took 57.20 ms. Allocated memory is still 1.1 GB. Free memory was 720.4 MB in the beginning and 713.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:08,939 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.16 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 308.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 43.82 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 493.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.7 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4890.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 720.4 MB in the end (delta: 310.2 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. * Witness Printer took 57.20 ms. Allocated memory is still 1.1 GB. Free memory was 720.4 MB in the beginning and 713.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. 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 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 6 locations. One deterministic module has affine ranking function -1 * i and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 57 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 6. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 61 SDtfs, 69 SDslu, 3 SDs, 0 SdLazy, 142 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax190 hnf98 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp93 dnf100 smp100 tf111 neg98 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31dab54a=0, \result=0, i=-1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) Loop: [L9] COND TRUE i != 0 [L10] COND TRUE i < 0 [L11] i = i+2 [L12] COND FALSE !(i < 0) [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...