./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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 b98f7fd40026cd249d1c292b5307435abc3c32a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:04:00,228 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:04:00,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:04:00,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:04:00,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:04:00,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:04:00,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:04:00,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:04:00,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:04:00,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:04:00,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:04:00,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:04:00,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:04:00,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:04:00,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:04:00,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:04:00,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:04:00,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:04:00,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:04:00,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:04:00,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:04:00,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:04:00,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:04:00,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:04:00,253 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:04:00,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:04:00,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:04:00,255 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:04:00,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:04:00,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:04:00,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:04:00,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:04:00,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:04:00,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:04:00,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:04:00,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:04:00,258 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:04:00,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:04:00,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:04:00,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:04:00,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:04:00,270 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:04:00,271 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:04:00,271 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:04:00,271 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:04:00,271 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:04:00,271 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:04:00,271 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:04:00,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:04:00,272 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:04:00,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:04:00,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:04:00,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:04:00,273 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:04:00,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:04:00,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:04:00,273 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:04:00,274 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:04:00,274 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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 -> b98f7fd40026cd249d1c292b5307435abc3c32a2 [2018-11-10 10:04:00,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:04:00,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:04:00,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:04:00,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:04:00,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:04:00,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c [2018-11-10 10:04:00,360 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/data/f75cf7103/c021f983105e4b4b828139d29a4b4cf0/FLAGab332440f [2018-11-10 10:04:00,689 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:04:00,689 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c [2018-11-10 10:04:00,693 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/data/f75cf7103/c021f983105e4b4b828139d29a4b4cf0/FLAGab332440f [2018-11-10 10:04:00,703 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/data/f75cf7103/c021f983105e4b4b828139d29a4b4cf0 [2018-11-10 10:04:00,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:04:00,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:04:00,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:04:00,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:04:00,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:04:00,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec24a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00, skipping insertion in model container [2018-11-10 10:04:00,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:04:00,738 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:04:00,862 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:04:00,864 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:04:00,875 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:04:00,883 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:04:00,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00 WrapperNode [2018-11-10 10:04:00,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:04:00,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:04:00,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:04:00,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:04:00,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:04:00,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:04:00,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:04:00,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:04:00,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... [2018-11-10 10:04:00,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:04:00,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:04:00,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:04:00,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:04:00,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:04:00,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:04:01,081 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:04:01,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:04:01 BoogieIcfgContainer [2018-11-10 10:04:01,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:04:01,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:04:01,082 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:04:01,084 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:04:01,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:04:01,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:04:00" (1/3) ... [2018-11-10 10:04:01,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51500639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:04:01, skipping insertion in model container [2018-11-10 10:04:01,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:04:01,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:04:00" (2/3) ... [2018-11-10 10:04:01,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51500639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:04:01, skipping insertion in model container [2018-11-10 10:04:01,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:04:01,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:04:01" (3/3) ... [2018-11-10 10:04:01,088 INFO L375 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c [2018-11-10 10:04:01,130 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:04:01,131 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:04:01,131 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:04:01,131 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:04:01,131 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:04:01,132 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:04:01,132 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:04:01,132 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:04:01,132 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:04:01,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-10 10:04:01,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:04:01,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:01,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:01,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:04:01,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:04:01,163 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:04:01,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-10 10:04:01,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:04:01,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:01,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:01,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:04:01,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:04:01,169 INFO L793 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 13#L20true assume main_~k~0 >= 1;main_~i~0 := 0; 9#L22-3true [2018-11-10 10:04:01,169 INFO L795 eck$LassoCheckResult]: Loop: 9#L22-3true assume true; 4#L22-1true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 5#L24-3true assume !true; 14#L24-4true main_~i~0 := main_~i~0 + 1; 9#L22-3true [2018-11-10 10:04:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-10 10:04:01,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1206921, now seen corresponding path program 1 times [2018-11-10 10:04:01,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:01,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:01,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:01,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:01,266 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-10 10:04:01,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:04:01,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:04:01,271 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:04:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:04:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:04:01,282 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-10 10:04:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:01,287 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-10 10:04:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:04:01,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-10 10:04:01,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:04:01,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2018-11-10 10:04:01,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-10 10:04:01,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 10:04:01,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-11-10 10:04:01,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:04:01,293 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 10:04:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-11-10 10:04:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-10 10:04:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:04:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-11-10 10:04:01,315 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 10:04:01,315 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 10:04:01,315 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:04:01,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2018-11-10 10:04:01,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:04:01,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:01,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:01,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:04:01,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:04:01,316 INFO L793 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 33#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 39#L22-3 [2018-11-10 10:04:01,317 INFO L795 eck$LassoCheckResult]: Loop: 39#L22-3 assume true; 34#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 35#L24-3 assume true; 36#L24-1 assume !(main_~j~0 <= main_~i~0); 38#L24-4 main_~i~0 := main_~i~0 + 1; 39#L22-3 [2018-11-10 10:04:01,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times [2018-11-10 10:04:01,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 37406706, now seen corresponding path program 1 times [2018-11-10 10:04:01,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:01,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:01,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 119476209, now seen corresponding path program 1 times [2018-11-10 10:04:01,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:01,367 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-10 10:04:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:04:01,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:04:01,403 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:01,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:01,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:01,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:01,404 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:01,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:01,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:01,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:01,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 10:04:01,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:01,405 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:01,422 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-10 10:04:01,433 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-10 10:04:01,451 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-10 10:04:01,515 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:01,515 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:01,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:01,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:01,542 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:01,542 INFO L446 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:01,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:01,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:01,578 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:01,578 INFO L446 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:01,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:01,584 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:01,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:01,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:01,751 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:01,752 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:01,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:01,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:01,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:01,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:01,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:01,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:01,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:01,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 10:04:01,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:01,753 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:01,755 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-10 10:04:01,757 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-10 10:04:01,759 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-10 10:04:01,815 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:01,818 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:01,819 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-10 10:04:01,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:01,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:01,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:01,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:01,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:01,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:01,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:01,829 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-10 10:04:01,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:01,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:01,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:01,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:01,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:01,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:01,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:01,837 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-10 10:04:01,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:01,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:01,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:01,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:01,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:01,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:01,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:01,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:01,851 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:04:01,851 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 10:04:01,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:01,852 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:04:01,853 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:01,853 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 10:04:01,854 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:04:01,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:01,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:01,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:01,909 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-10 10:04:01,912 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-10 10:04:01,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 10:04:01,980 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 22 states and 27 transitions. Complement of second has 8 states. [2018-11-10 10:04:01,981 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-10 10:04:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:04:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 10:04:01,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 10:04:01,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:01,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 10:04:01,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:01,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 10:04:01,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:01,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-10 10:04:01,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:04:01,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2018-11-10 10:04:01,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 10:04:01,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 10:04:01,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-10 10:04:01,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:01,988 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 10:04:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-10 10:04:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-10 10:04:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 10:04:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-10 10:04:01,990 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 10:04:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:04:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:04:01,990 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 4 states. [2018-11-10 10:04:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:02,002 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-10 10:04:02,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:04:02,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-10 10:04:02,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:04:02,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 11 states and 12 transitions. [2018-11-10 10:04:02,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 10:04:02,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 10:04:02,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-10 10:04:02,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:04:02,004 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 10:04:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-10 10:04:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-10 10:04:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 10:04:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-11-10 10:04:02,006 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-10 10:04:02,006 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-10 10:04:02,006 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:04:02,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-11-10 10:04:02,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:04:02,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:02,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:02,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:04:02,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 10:04:02,007 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 157#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 163#L22-3 [2018-11-10 10:04:02,007 INFO L795 eck$LassoCheckResult]: Loop: 163#L22-3 assume true; 160#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 158#L24-3 assume true; 159#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 162#L24-3 assume true; 165#L24-1 assume !(main_~j~0 <= main_~i~0); 164#L24-4 main_~i~0 := main_~i~0 + 1; 163#L22-3 [2018-11-10 10:04:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 3 times [2018-11-10 10:04:02,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1588156812, now seen corresponding path program 1 times [2018-11-10 10:04:02,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1147429429, now seen corresponding path program 1 times [2018-11-10 10:04:02,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,065 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:02,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:02,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:02,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:02,066 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:02,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:02,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:02,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:02,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 10:04:02,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:02,066 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:02,067 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-10 10:04:02,071 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-10 10:04:02,075 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-10 10:04:02,113 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:02,113 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:02,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:02,142 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:02,142 INFO L446 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:02,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:02,162 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:02,163 INFO L446 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:02,165 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:02,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:02,333 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:02,334 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:02,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:02,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:02,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:02,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:02,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:02,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:02,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:02,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 10:04:02,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:02,336 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:02,337 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-10 10:04:02,339 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-10 10:04:02,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-10 10:04:02,389 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:02,389 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:02,390 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-10 10:04:02,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:02,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:02,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:02,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:02,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:02,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:02,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:02,395 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-10 10:04:02,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:02,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:02,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:02,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:02,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:02,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:02,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:02,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:02,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:04:02,406 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:04:02,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:02,407 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:04:02,407 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:02,407 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 10:04:02,407 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:04:02,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:02,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:02,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:02,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 10:04:02,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-10 10:04:02,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 26 states and 31 transitions. Complement of second has 10 states. [2018-11-10 10:04:02,489 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-10 10:04:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 10:04:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-10 10:04:02,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-10 10:04:02,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:02,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-10 10:04:02,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:02,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-10 10:04:02,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:02,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 10:04:02,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 10:04:02,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 30 transitions. [2018-11-10 10:04:02,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 10:04:02,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 10:04:02,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-10 10:04:02,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:02,494 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 10:04:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-10 10:04:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-10 10:04:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 10:04:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-10 10:04:02,496 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-10 10:04:02,496 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-10 10:04:02,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:04:02,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-10 10:04:02,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 10:04:02,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:02,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:02,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:04:02,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-11-10 10:04:02,498 INFO L793 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 255#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 267#L22-3 assume true; 256#L22-1 [2018-11-10 10:04:02,498 INFO L795 eck$LassoCheckResult]: Loop: 256#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 257#L24-3 assume true; 260#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 263#L24-3 assume true; 272#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 271#L24-3 assume true; 270#L24-1 assume !(main_~j~0 <= main_~i~0); 268#L24-4 main_~i~0 := main_~i~0 + 1; 265#L22-3 assume true; 256#L22-1 [2018-11-10 10:04:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash 925607, now seen corresponding path program 1 times [2018-11-10 10:04:02,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1504482198, now seen corresponding path program 2 times [2018-11-10 10:04:02,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:02,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:02,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 576161668, now seen corresponding path program 2 times [2018-11-10 10:04:02,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:02,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:02,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:04:02,540 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:04:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:04:02,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:04:02,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:04:02,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:02,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:04:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 10:04:02,650 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:02,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:02,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:02,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:02,651 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:02,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:02,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:02,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:02,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 10:04:02,651 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:02,651 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:02,652 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-10 10:04:02,653 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-10 10:04:02,660 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-10 10:04:02,698 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:02,698 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:02,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:02,717 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:02,717 INFO L446 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_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:02,720 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/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-10 10:04:02,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:02,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:03,114 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:03,116 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:03,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:03,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:03,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:03,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:03,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:03,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:03,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:03,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 10:04:03,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:03,116 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:03,117 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-10 10:04:03,119 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-10 10:04:03,125 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-10 10:04:03,155 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:03,155 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:03,155 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-10 10:04:03,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:03,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:03,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:03,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:03,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:03,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:03,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:03,161 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-10 10:04:03,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:03,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:03,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:03,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:03,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:03,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:03,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:03,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:03,171 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:04:03,171 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:04:03,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:03,172 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:04:03,172 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:03,172 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~k~0) = -1*ULTIMATE.start_main_~i~0 + 2*ULTIMATE.start_main_~k~0 Supporting invariants [] [2018-11-10 10:04:03,173 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:04:03,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:03,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:03,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:03,229 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:04:03,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 10:04:03,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 66 states and 81 transitions. Complement of second has 12 states. [2018-11-10 10:04:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:04:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 10:04:03,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-10 10:04:03,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:03,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 10:04:03,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:03,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-10 10:04:03,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:03,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2018-11-10 10:04:03,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 10:04:03,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 64 states and 79 transitions. [2018-11-10 10:04:03,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 10:04:03,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 10:04:03,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2018-11-10 10:04:03,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:03,277 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-10 10:04:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2018-11-10 10:04:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-10 10:04:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 10:04:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-11-10 10:04:03,281 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-10 10:04:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:04:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:04:03,281 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 8 states. [2018-11-10 10:04:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:03,307 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-10 10:04:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:04:03,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 98 transitions. [2018-11-10 10:04:03,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 10:04:03,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 74 states and 89 transitions. [2018-11-10 10:04:03,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 10:04:03,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 10:04:03,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 89 transitions. [2018-11-10 10:04:03,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:03,309 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-10 10:04:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 89 transitions. [2018-11-10 10:04:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-11-10 10:04:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 10:04:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-10 10:04:03,312 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-10 10:04:03,312 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-10 10:04:03,312 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:04:03,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 79 transitions. [2018-11-10 10:04:03,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 10:04:03,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:03,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:03,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:04:03,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2018-11-10 10:04:03,314 INFO L793 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 607#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 619#L22-3 assume true; 620#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 643#L24-3 assume true; 617#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 618#L24-3 assume true; 664#L24-1 assume !(main_~j~0 <= main_~i~0); 645#L24-4 main_~i~0 := main_~i~0 + 1; 634#L22-3 assume true; 631#L22-1 [2018-11-10 10:04:03,314 INFO L795 eck$LassoCheckResult]: Loop: 631#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 612#L24-3 assume true; 613#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 616#L24-3 assume true; 630#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 629#L24-3 assume true; 628#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 627#L24-3 assume true; 626#L24-1 assume !(main_~j~0 <= main_~i~0); 622#L24-4 main_~i~0 := main_~i~0 + 1; 623#L22-3 assume true; 631#L22-1 [2018-11-10 10:04:03,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1210573922, now seen corresponding path program 3 times [2018-11-10 10:04:03,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:03,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:03,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:03,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1598149968, now seen corresponding path program 3 times [2018-11-10 10:04:03,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:03,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:03,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:03,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:03,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1154303379, now seen corresponding path program 4 times [2018-11-10 10:04:03,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:03,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:04:03,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:04:03,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:04:03,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:04:03,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:04:03,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:04:03,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:04:03,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:04:03,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 10:04:03,501 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:03,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:03,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:03,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:03,501 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:03,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:03,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:03,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:03,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 10:04:03,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:03,502 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:03,503 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-10 10:04:03,509 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-10 10:04:03,511 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-10 10:04:03,539 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:03,539 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:03,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:03,542 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:03,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:03,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:03,949 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:03,950 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:03,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:03,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:03,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:03,950 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:03,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:03,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:03,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:03,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 10:04:03,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:03,951 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:03,952 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-10 10:04:03,956 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-10 10:04:03,962 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-10 10:04:03,985 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:03,986 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:03,986 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-10 10:04:03,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:03,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:03,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:03,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:03,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:03,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:03,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:03,991 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-10 10:04:03,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:03,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:03,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:03,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:03,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:03,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:03,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:03,998 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:04,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:04:04,002 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:04:04,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:04,002 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:04:04,002 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:04,003 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 10:04:04,003 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:04:04,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:04,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:04,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:04:04,041 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-10 10:04:04,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 79 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-10 10:04:04,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 79 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 121 states and 148 transitions. Complement of second has 6 states. [2018-11-10 10:04:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:04:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 10:04:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 11 letters. [2018-11-10 10:04:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 22 letters. Loop has 11 letters. [2018-11-10 10:04:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 22 letters. [2018-11-10 10:04:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:04,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 148 transitions. [2018-11-10 10:04:04,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 10:04:04,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 77 states and 93 transitions. [2018-11-10 10:04:04,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 10:04:04,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 10:04:04,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 93 transitions. [2018-11-10 10:04:04,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:04,056 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-10 10:04:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 93 transitions. [2018-11-10 10:04:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-11-10 10:04:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 10:04:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-11-10 10:04:04,060 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-10 10:04:04,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:04:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:04:04,061 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 12 states. [2018-11-10 10:04:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:04:04,133 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2018-11-10 10:04:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:04:04,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 148 transitions. [2018-11-10 10:04:04,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 10:04:04,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 108 states and 132 transitions. [2018-11-10 10:04:04,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 10:04:04,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 10:04:04,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 132 transitions. [2018-11-10 10:04:04,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:04,138 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 132 transitions. [2018-11-10 10:04:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 132 transitions. [2018-11-10 10:04:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2018-11-10 10:04:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 10:04:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-11-10 10:04:04,143 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-11-10 10:04:04,143 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-11-10 10:04:04,143 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:04:04,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 111 transitions. [2018-11-10 10:04:04,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 10:04:04,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:04,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:04,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-10 10:04:04,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 10:04:04,145 INFO L793 eck$LassoCheckResult]: Stem: 1170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1161#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 1173#L22-3 assume true; 1174#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1168#L24-3 assume true; 1169#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1247#L24-3 assume true; 1238#L24-1 assume !(main_~j~0 <= main_~i~0); 1236#L24-4 main_~i~0 := main_~i~0 + 1; 1237#L22-3 assume true; 1191#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1190#L24-3 assume true; 1189#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1188#L24-3 assume true; 1187#L24-1 assume !(main_~j~0 <= main_~i~0); 1186#L24-4 main_~i~0 := main_~i~0 + 1; 1184#L22-3 assume true; 1179#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1166#L24-3 [2018-11-10 10:04:04,145 INFO L795 eck$LassoCheckResult]: Loop: 1166#L24-3 assume true; 1167#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1166#L24-3 [2018-11-10 10:04:04,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1221684520, now seen corresponding path program 5 times [2018-11-10 10:04:04,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1575, now seen corresponding path program 1 times [2018-11-10 10:04:04,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:04,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1512752526, now seen corresponding path program 6 times [2018-11-10 10:04:04,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:04,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:04,226 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:04,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:04,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:04,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:04,227 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:04,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:04,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:04,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-10 10:04:04,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:04,227 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:04,228 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-10 10:04:04,233 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-10 10:04:04,235 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-10 10:04:04,237 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-10 10:04:04,239 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-10 10:04:04,241 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-10 10:04:04,243 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-10 10:04:04,251 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-10 10:04:04,286 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:04,286 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,290 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,290 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,310 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,310 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,341 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,341 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,362 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,362 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,397 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,397 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:04,402 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:04,402 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:04,419 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:04,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:04,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:05,258 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:05,260 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:05,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:05,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:05,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:05,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:05,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:05,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:05,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:05,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-10 10:04:05,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:05,260 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:05,262 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-10 10:04:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:04:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:04:05,266 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-10 10:04:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:04:05,269 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-10 10:04:05,271 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-10 10:04:05,272 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-10 10:04:05,312 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:05,312 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:05,312 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-10 10:04:05,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:05,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:05,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:05,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,314 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-10 10:04:05,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:05,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:05,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:05,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,316 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-10 10:04:05,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:05,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:05,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:05,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,318 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-10 10:04:05,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:05,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:05,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,321 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-10 10:04:05,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:05,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:05,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:05,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,323 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-10 10:04:05,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:05,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:05,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,327 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-10 10:04:05,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:05,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:05,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:05,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:05,329 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-10 10:04:05,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:05,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:05,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:05,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:05,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:05,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:05,340 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:05,345 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:04:05,345 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:04:05,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:05,348 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 10:04:05,348 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:05,348 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~k~0 - 2 >= 0] [2018-11-10 10:04:05,356 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 10:04:05,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,427 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-10 10:04:05,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 1 loop predicates [2018-11-10 10:04:05,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-11-10 10:04:05,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 93 states and 111 transitions. Complement of second has 4 states. [2018-11-10 10:04:05,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:04:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-10 10:04:05,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-10 10:04:05,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:05,445 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:04:05,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,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-10 10:04:05,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 1 loop predicates [2018-11-10 10:04:05,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-11-10 10:04:05,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 93 states and 111 transitions. Complement of second has 4 states. [2018-11-10 10:04:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:04:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-10 10:04:05,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-10 10:04:05,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:05,508 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:04:05,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:05,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:05,581 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-10 10:04:05,581 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 1 loop predicates [2018-11-10 10:04:05,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-11-10 10:04:05,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 111 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 184 states and 214 transitions. Complement of second has 18 states. [2018-11-10 10:04:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-10 10:04:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:04:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2018-11-10 10:04:05,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-10 10:04:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-10 10:04:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-10 10:04:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:05,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 214 transitions. [2018-11-10 10:04:05,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 10:04:05,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 49 states and 55 transitions. [2018-11-10 10:04:05,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 10:04:05,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 10:04:05,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2018-11-10 10:04:05,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:04:05,718 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-10 10:04:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2018-11-10 10:04:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-10 10:04:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 10:04:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-10 10:04:05,720 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 10:04:05,720 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 10:04:05,720 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:04:05,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2018-11-10 10:04:05,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 10:04:05,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:04:05,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:04:05,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-10 10:04:05,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 10:04:05,724 INFO L793 eck$LassoCheckResult]: Stem: 1900#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~k~0, main_~i~0, main_~j~0, main_~n~0;havoc main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~k~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~j~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1893#L20 assume main_~k~0 >= 1;main_~i~0 := 0; 1906#L22-3 assume true; 1914#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1913#L24-3 assume true; 1912#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1911#L24-3 assume true; 1910#L24-1 assume !(main_~j~0 <= main_~i~0); 1907#L24-4 main_~i~0 := main_~i~0 + 1; 1902#L22-3 assume true; 1903#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1936#L24-3 assume true; 1934#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1932#L24-3 assume true; 1930#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1929#L24-3 assume true; 1928#L24-1 assume !(main_~j~0 <= main_~i~0); 1919#L24-4 main_~i~0 := main_~i~0 + 1; 1925#L22-3 assume true; 1894#L22-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1895#L24-3 [2018-11-10 10:04:05,724 INFO L795 eck$LassoCheckResult]: Loop: 1895#L24-3 assume true; 1898#L24-1 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := main_~j~0 + main_~k~0; 1895#L24-3 [2018-11-10 10:04:05,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1561205826, now seen corresponding path program 7 times [2018-11-10 10:04:05,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:05,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1575, now seen corresponding path program 2 times [2018-11-10 10:04:05,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:05,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:04:05,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1375213096, now seen corresponding path program 8 times [2018-11-10 10:04:05,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:04:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:04:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:04:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:04:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:04:05,815 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:05,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:05,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:05,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:05,815 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:04:05,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:05,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:05,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:05,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration7_Lasso [2018-11-10 10:04:05,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:05,815 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:05,816 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-10 10:04:05,819 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-10 10:04:05,827 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-10 10:04:05,829 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-10 10:04:05,830 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-10 10:04:05,831 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-10 10:04:05,833 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-10 10:04:05,834 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-10 10:04:05,874 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:05,874 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:05,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:05,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:05,878 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:04:05,879 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:05,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:04:05,896 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acd710f3-9ee3-4b66-bdcc-367ac83486f1/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:05,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:04:05,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:04:06,606 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:04:06,608 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:04:06,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:04:06,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:04:06,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:04:06,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:04:06,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:04:06,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:04:06,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:04:06,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig9a_true-termination_true-no-overflow.c_Iteration7_Lasso [2018-11-10 10:04:06,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:04:06,608 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:04:06,609 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-10 10:04:06,610 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-10 10:04:06,616 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-10 10:04:06,625 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-10 10:04:06,626 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-10 10:04:06,628 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-10 10:04:06,629 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-10 10:04:06,631 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-10 10:04:06,681 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:04:06,681 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:04:06,681 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-10 10:04:06,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:06,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:06,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:06,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:06,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:06,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:06,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:06,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:06,683 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-10 10:04:06,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:06,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:04:06,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:06,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:06,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:06,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:04:06,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:04:06,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:04:06,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:04:06,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:04:06,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:04:06,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:04:06,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:04:06,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:04:06,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:04:06,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:04:06,702 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:04:06,702 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:04:06,703 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:04:06,703 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 10:04:06,704 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:04:06,704 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~k~0 - 1 >= 0] [2018-11-10 10:04:06,706 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 10:04:06,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,746 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-10 10:04:06,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-10 10:04:06,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 10:04:06,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 48 states and 54 transitions. Complement of second has 6 states. [2018-11-10 10:04:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:04:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-10 10:04:06,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-10 10:04:06,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:06,771 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:04:06,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,806 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-10 10:04:06,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-10 10:04:06,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 10:04:06,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 48 states and 54 transitions. Complement of second has 6 states. [2018-11-10 10:04:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:04:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-10 10:04:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-10 10:04:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:06,824 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:04:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:04:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:06,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:04:06,856 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-10 10:04:06,856 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-10 10:04:06,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 10:04:06,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 51 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 64 states and 72 transitions. Complement of second has 5 states. [2018-11-10 10:04:06,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 10:04:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:04:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 10:04:06,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-10 10:04:06,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:06,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-10 10:04:06,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:06,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-10 10:04:06,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:04:06,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2018-11-10 10:04:06,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:04:06,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-10 10:04:06,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:04:06,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:04:06,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:04:06,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:04:06,876 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:04:06,876 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:04:06,876 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:04:06,876 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:04:06,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:04:06,877 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:04:06,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:04:06,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:04:06 BoogieIcfgContainer [2018-11-10 10:04:06,883 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:04:06,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:04:06,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:04:06,883 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:04:06,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:04:01" (3/4) ... [2018-11-10 10:04:06,887 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:04:06,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:04:06,888 INFO L168 Benchmark]: Toolchain (without parser) took 6181.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 959.2 MB in the beginning and 873.5 MB in the end (delta: 85.7 MB). Peak memory consumption was 310.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:06,889 INFO L168 Benchmark]: CDTParser took 0.15 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-10 10:04:06,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:06,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:04:06,890 INFO L168 Benchmark]: Boogie Preprocessor took 10.51 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:06,890 INFO L168 Benchmark]: RCFGBuilder took 166.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:06,891 INFO L168 Benchmark]: BuchiAutomizer took 5800.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 873.5 MB in the end (delta: 271.1 MB). Peak memory consumption was 340.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:06,891 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 873.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:04:06,894 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.15 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 175.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.51 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5800.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 873.5 MB in the end (delta: 271.1 MB). Peak memory consumption was 340.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 873.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (4 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 5 locations. One deterministic module has affine ranking function k + -1 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + 2 * k and consists of 7 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function i + -1 * j + 1 and consists of 11 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 93 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/20 HoareTripleCheckerStatistics: 102 SDtfs, 136 SDslu, 139 SDs, 0 SdLazy, 294 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax156 hnf97 lsp63 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf104 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...