./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer --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.23-aa41828 [2018-11-22 22:24:16,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:24:16,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:24:16,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:24:16,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:24:16,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:24:16,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:24:16,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:24:16,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:24:16,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:24:16,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:24:16,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:24:16,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:24:16,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:24:16,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:24:16,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:24:16,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:24:16,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:24:16,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:24:16,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:24:16,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:24:16,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:24:16,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:24:16,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:24:16,918 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:24:16,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:24:16,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:24:16,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:24:16,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:24:16,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:24:16,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:24:16,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:24:16,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:24:16,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:24:16,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:24:16,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:24:16,924 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:24:16,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:24:16,934 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:24:16,935 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:24:16,935 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:24:16,935 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:24:16,936 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:24:16,936 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:24:16,936 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:24:16,936 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:24:16,936 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:24:16,936 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:24:16,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:24:16,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:24:16,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:24:16,938 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:24:16,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:24:16,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:24:16,939 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:24:16,940 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:24:16,940 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer 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 [2018-11-22 22:24:16,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:24:16,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:24:16,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:24:16,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:24:16,974 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:24:16,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c [2018-11-22 22:24:17,013 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/data/d036e3ddb/9ddf3d788fa74b548e8df1b0014ae309/FLAGdcd09bc6a [2018-11-22 22:24:17,401 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:24:17,402 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/sv-benchmarks/c/termination-restricted-15/AlternKonv_false-termination_true-no-overflow.c [2018-11-22 22:24:17,405 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/data/d036e3ddb/9ddf3d788fa74b548e8df1b0014ae309/FLAGdcd09bc6a [2018-11-22 22:24:17,413 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/data/d036e3ddb/9ddf3d788fa74b548e8df1b0014ae309 [2018-11-22 22:24:17,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:24:17,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:24:17,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:24:17,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:24:17,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:24:17,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787be1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17, skipping insertion in model container [2018-11-22 22:24:17,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:24:17,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:24:17,538 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:24:17,540 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:24:17,548 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:24:17,556 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:24:17,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17 WrapperNode [2018-11-22 22:24:17,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:24:17,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:24:17,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:24:17,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:24:17,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:24:17,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:24:17,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:24:17,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:24:17,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... [2018-11-22 22:24:17,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:24:17,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:24:17,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:24:17,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:24:17,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:24:17,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:24:17,774 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:24:17,774 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 22:24:17,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:17 BoogieIcfgContainer [2018-11-22 22:24:17,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:24:17,775 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:24:17,775 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:24:17,778 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:24:17,778 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:17,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:24:17" (1/3) ... [2018-11-22 22:24:17,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dd0a915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:24:17, skipping insertion in model container [2018-11-22 22:24:17,779 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:17,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:17" (2/3) ... [2018-11-22 22:24:17,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dd0a915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:24:17, skipping insertion in model container [2018-11-22 22:24:17,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:17,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:17" (3/3) ... [2018-11-22 22:24:17,781 INFO L375 chiAutomizerObserver]: Analyzing ICFG AlternKonv_false-termination_true-no-overflow.c [2018-11-22 22:24:17,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:24:17,824 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:24:17,824 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:24:17,824 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:24:17,824 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:24:17,825 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:24:17,825 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:24:17,825 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:24:17,825 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:24:17,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-22 22:24:17,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-22 22:24:17,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:17,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:17,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:24:17,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:24:17,854 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:24:17,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-22 22:24:17,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-22 22:24:17,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:17,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:17,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:24:17,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:24:17,860 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 [2018-11-22 22:24:17,860 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 [2018-11-22 22:24:17,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-22 22:24:17,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:17,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash 39827, now seen corresponding path program 1 times [2018-11-22 22:24:17,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:17,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash 963348, now seen corresponding path program 1 times [2018-11-22 22:24:17,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:17,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,999 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:18,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:18,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:18,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:18,001 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:24:18,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:18,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:18,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:18,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-22 22:24:18,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:18,002 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:18,114 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:24:18,136 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 /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:18,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:24:18,156 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 /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,162 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:24:18,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,198 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:24:18,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:18,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:18,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:18,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:18,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:18,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:18,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:18,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:18,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-22 22:24:18,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:18,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:18,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:18,262 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:18,263 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 [2018-11-22 22:24:18,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,275 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 [2018-11-22 22:24:18,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,285 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 [2018-11-22 22:24:18,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:18,295 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:24:18,295 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:24:18,297 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:18,297 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:24:18,298 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:18,298 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:18,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:24:18,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:18,386 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 [2018-11-22 22:24:18,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-22 22:24:18,435 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. [2018-11-22 22:24:18,435 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 [2018-11-22 22:24:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 22:24:18,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-22 22:24:18,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-22 22:24:18,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 6 letters. [2018-11-22 22:24:18,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-11-22 22:24:18,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-22 22:24:18,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 14 states and 20 transitions. [2018-11-22 22:24:18,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-22 22:24:18,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:24:18,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:18,449 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-22 22:24:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 22:24:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-22 22:24:18,470 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-22 22:24:18,470 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-22 22:24:18,470 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:24:18,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2018-11-22 22:24:18,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-22 22:24:18,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:18,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:18,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:24:18,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:24:18,471 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 [2018-11-22 22:24:18,471 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 [2018-11-22 22:24:18,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 1 times [2018-11-22 22:24:18,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash 57996, now seen corresponding path program 1 times [2018-11-22 22:24:18,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:24:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-22 22:24:18,499 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:24:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:24:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:24:18,501 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-22 22:24:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:24:18,519 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-11-22 22:24:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:24:18,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 22:24:18,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 20 transitions. [2018-11-22 22:24:18,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:24:18,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:24:18,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:18,520 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-22 22:24:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-22 22:24:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-22 22:24:18,522 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,522 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,522 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:24:18,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 22:24:18,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:18,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:18,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:24:18,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:24:18,523 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 [2018-11-22 22:24:18,523 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 [2018-11-22 22:24:18,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 2 times [2018-11-22 22:24:18,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 59918, now seen corresponding path program 1 times [2018-11-22 22:24:18,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:24:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:24:18,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:24:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:24:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:24:18,545 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-22 22:24:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:24:18,563 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-11-22 22:24:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:24:18,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-22 22:24:18,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:24:18,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-11-22 22:24:18,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 22:24:18,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 22:24:18,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-22 22:24:18,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:18,565 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:24:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-22 22:24:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-22 22:24:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-22 22:24:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-22 22:24:18,566 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,566 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-22 22:24:18,566 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:24:18,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-22 22:24:18,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 22:24:18,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:18,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:18,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:24:18,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2018-11-22 22:24:18,567 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 [2018-11-22 22:24:18,567 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 [2018-11-22 22:24:18,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 31088, now seen corresponding path program 3 times [2018-11-22 22:24:18,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1727393992, now seen corresponding path program 1 times [2018-11-22 22:24:18,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 684415735, now seen corresponding path program 1 times [2018-11-22 22:24:18,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,642 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:18,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:18,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:18,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:18,643 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:24:18,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:18,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:18,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:18,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-22 22:24:18,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:18,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:18,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:18,683 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,702 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:24:18,702 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 /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:24:18,721 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 /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:18,724 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:18,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:24:18,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:18,761 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:24:18,762 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:18,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:18,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:18,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:18,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:18,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:18,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:18,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:18,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-22 22:24:18,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:18,763 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:18,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:18,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:18,808 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 [2018-11-22 22:24:18,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,814 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 [2018-11-22 22:24:18,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,823 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 [2018-11-22 22:24:18,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,827 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:18,829 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-22 22:24:18,829 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:24:18,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:18,830 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:24:18,830 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:18,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:18,830 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:24:18,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:18,863 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 [2018-11-22 22:24:18,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-22 22:24:18,882 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. [2018-11-22 22:24:18,883 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 [2018-11-22 22:24:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-22 22:24:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-22 22:24:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,884 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:24:18,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:18,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:18,939 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 [2018-11-22 22:24:18,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-22 22:24:18,972 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. [2018-11-22 22:24:18,972 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 [2018-11-22 22:24:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-22 22:24:18,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-22 22:24:18,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-22 22:24:18,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-22 22:24:18,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:18,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 63 transitions. [2018-11-22 22:24:18,975 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-22 22:24:18,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 60 transitions. [2018-11-22 22:24:18,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-22 22:24:18,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 22:24:18,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2018-11-22 22:24:18,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:18,976 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2018-11-22 22:24:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2018-11-22 22:24:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-22 22:24:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:24:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2018-11-22 22:24:18,978 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2018-11-22 22:24:18,979 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2018-11-22 22:24:18,979 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:24:18,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 55 transitions. [2018-11-22 22:24:18,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-22 22:24:18,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:18,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:18,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:24:18,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:24:18,980 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 [2018-11-22 22:24:18,980 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 [2018-11-22 22:24:18,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2018-11-22 22:24:18,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1559161, now seen corresponding path program 1 times [2018-11-22 22:24:18,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:18,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 608049029, now seen corresponding path program 1 times [2018-11-22 22:24:18,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:18,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:18,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:19,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:24:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:24:19,039 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:19,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:19,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:19,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:19,039 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:24:19,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:19,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:19,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-22 22:24:19,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:19,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:19,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,069 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:19,069 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:19,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:19,086 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:24:19,086 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 /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:19,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:19,089 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:19,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:24:19,105 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:24:19,154 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:24:19,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:19,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:19,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:19,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:19,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:19,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:19,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:19,156 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-22 22:24:19,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:19,156 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:19,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,181 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:19,182 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:19,182 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 [2018-11-22 22:24:19,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:19,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:19,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:19,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:19,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:19,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:19,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:19,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:19,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:24:19,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:24:19,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:19,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:24:19,188 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:19,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:19,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:24:19,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:19,228 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 [2018-11-22 22:24:19,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 55 transitions. cyclomatic complexity: 24 Second operand 4 states. [2018-11-22 22:24:19,276 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. [2018-11-22 22:24:19,277 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 [2018-11-22 22:24:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-22 22:24:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-22 22:24:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-22 22:24:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-22 22:24:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 212 transitions. [2018-11-22 22:24:19,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-11-22 22:24:19,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 121 states and 178 transitions. [2018-11-22 22:24:19,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-22 22:24:19,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-22 22:24:19,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 178 transitions. [2018-11-22 22:24:19,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:19,284 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 178 transitions. [2018-11-22 22:24:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 178 transitions. [2018-11-22 22:24:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-11-22 22:24:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-22 22:24:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2018-11-22 22:24:19,290 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 153 transitions. [2018-11-22 22:24:19,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:24:19,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:24:19,290 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand 4 states. [2018-11-22 22:24:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:24:19,304 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2018-11-22 22:24:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:24:19,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 105 transitions. [2018-11-22 22:24:19,306 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2018-11-22 22:24:19,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 72 states and 97 transitions. [2018-11-22 22:24:19,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-22 22:24:19,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-22 22:24:19,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2018-11-22 22:24:19,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:19,307 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2018-11-22 22:24:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2018-11-22 22:24:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2018-11-22 22:24:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 22:24:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-22 22:24:19,310 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-22 22:24:19,310 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-22 22:24:19,310 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:24:19,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-22 22:24:19,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-22 22:24:19,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:19,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:19,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:24:19,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:24:19,311 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 [2018-11-22 22:24:19,311 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 [2018-11-22 22:24:19,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash 963757, now seen corresponding path program 1 times [2018-11-22 22:24:19,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash 39827, now seen corresponding path program 2 times [2018-11-22 22:24:19,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1353476249, now seen corresponding path program 2 times [2018-11-22 22:24:19,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,346 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:19,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:19,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:19,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:19,347 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:24:19,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:19,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:19,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-22 22:24:19,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:19,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:19,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:19,373 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/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 [2018-11-22 22:24:19,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:24:19,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-22 22:24:19,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:24:19,398 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,414 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:24:19,415 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:19,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:19,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:19,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:19,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:19,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:19,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:19,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:19,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: AlternKonv_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-22 22:24:19,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:19,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:19,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:19,443 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:19,443 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:19,443 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 [2018-11-22 22:24:19,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:19,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:19,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:19,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:19,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:19,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:19,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:19,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:19,448 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-22 22:24:19,448 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:24:19,448 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:19,449 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:24:19,449 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:19,449 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:19,449 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:24:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:19,469 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 [2018-11-22 22:24:19,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-22 22:24:19,478 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. [2018-11-22 22:24:19,479 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 [2018-11-22 22:24:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-22 22:24:19,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-22 22:24:19,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-22 22:24:19,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-22 22:24:19,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2018-11-22 22:24:19,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-22 22:24:19,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 88 transitions. [2018-11-22 22:24:19,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-22 22:24:19,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-22 22:24:19,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 88 transitions. [2018-11-22 22:24:19,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:19,482 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 88 transitions. [2018-11-22 22:24:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 88 transitions. [2018-11-22 22:24:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-22 22:24:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 22:24:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-11-22 22:24:19,485 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 80 transitions. [2018-11-22 22:24:19,485 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 80 transitions. [2018-11-22 22:24:19,487 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:24:19,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 80 transitions. [2018-11-22 22:24:19,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-22 22:24:19,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:19,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:19,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:24:19,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2018-11-22 22:24:19,488 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 [2018-11-22 22:24:19,488 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 [2018-11-22 22:24:19,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 963759, now seen corresponding path program 1 times [2018-11-22 22:24:19,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1186496604, now seen corresponding path program 1 times [2018-11-22 22:24:19,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1517058698, now seen corresponding path program 1 times [2018-11-22 22:24:19,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:19,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:19,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:19,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_~i~0); [?] assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; [?] assume !(main_~i~0 < 0); [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- [2018-11-22 22:24:19,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:24:19 BoogieIcfgContainer [2018-11-22 22:24:19,551 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:24:19,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:24:19,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:24:19,552 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:24:19,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:17" (3/4) ... [2018-11-22 22:24:19,554 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_~i~0); [?] assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; [?] assume !(main_~i~0 < 0); [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- [2018-11-22 22:24:19,584 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd42281d-506f-409e-bbbd-8ab584ffb4db/bin-2019/uautomizer/witness.graphml [2018-11-22 22:24:19,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:24:19,585 INFO L168 Benchmark]: Toolchain (without parser) took 2169.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,587 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,588 INFO L168 Benchmark]: Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,588 INFO L168 Benchmark]: RCFGBuilder took 177.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,589 INFO L168 Benchmark]: BuchiAutomizer took 1776.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,589 INFO L168 Benchmark]: Witness Printer took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,592 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 25.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 177.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1776.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Witness Printer took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.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 1.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. 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.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax187 hnf98 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf95 smp87 dnf100 smp100 tf112 neg98 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - 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@6a6042bf=0, \result=0, i=-1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_~i~0); [?] assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; [?] assume !(main_~i~0 < 0); [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_~i~0); [?] assume main_~i~0 < 0;main_~i~0 := 2 + main_~i~0; [?] assume !(main_~i~0 < 0); [?] assume !!(0 != main_~i~0); [?] assume !(main_~i~0 < 0);main_~i~0 := main_~i~0 - 2; [?] assume !(main_~i~0 > 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume main_~i~0 < 0; [L11] main_~i~0 := 2 + main_~i~0; [L12-L15] assume !(main_~i~0 < 0); [L9-L22] assume !!(0 != main_~i~0); [L10-L21] assume !(main_~i~0 < 0); [L17] main_~i~0 := main_~i~0 - 2; [L18-L20] assume !(main_~i~0 > 0); [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND TRUE main_~i~0 < 0 [L11] main_~i~0 := 2 + main_~i~0; [L12] COND FALSE !(main_~i~0 < 0) [L9-L22] COND FALSE !(!(0 != main_~i~0)) [L10] COND FALSE !(main_~i~0 < 0) [L17] main_~i~0 := main_~i~0 - 2; [L18] COND FALSE !(main_~i~0 > 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND TRUE ~i~0 < 0 [L11] ~i~0 := 2 + ~i~0; [L12] COND FALSE !(~i~0 < 0) [L9-L22] COND FALSE !(!(0 != ~i~0)) [L10] COND FALSE !(~i~0 < 0) [L17] ~i~0 := ~i~0 - 2; [L18] COND FALSE !(~i~0 > 0) [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) ----- 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...