./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:08:02,579 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:08:02,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:08:02,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:08:02,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:08:02,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:08:02,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:08:02,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:08:02,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:08:02,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:08:02,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:08:02,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:08:02,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:08:02,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:08:02,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:08:02,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:08:02,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:08:02,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:08:02,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:08:02,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:08:02,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:08:02,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:08:02,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:08:02,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:08:02,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:08:02,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:08:02,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:08:02,604 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:08:02,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:08:02,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:08:02,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:08:02,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:08:02,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:08:02,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:08:02,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:08:02,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:08:02,608 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:08:02,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:08:02,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:08:02,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:08:02,620 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:08:02,620 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:08:02,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:08:02,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:08:02,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:08:02,622 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:08:02,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:08:02,623 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:08:02,623 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:08:02,623 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:08:02,623 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_792c11fd-3911-452c-a420-f08e6e5c7cb2/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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-11-23 02:08:02,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:08:02,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:08:02,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:08:02,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:08:02,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:08:02,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-23 02:08:02,691 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/data/03595ec53/c09c9b97cffb4ebd8f773975a9e7106c/FLAG3b32b6d86 [2018-11-23 02:08:03,094 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:08:03,094 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-23 02:08:03,098 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/data/03595ec53/c09c9b97cffb4ebd8f773975a9e7106c/FLAG3b32b6d86 [2018-11-23 02:08:03,107 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/data/03595ec53/c09c9b97cffb4ebd8f773975a9e7106c [2018-11-23 02:08:03,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:08:03,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:08:03,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:08:03,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:08:03,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:08:03,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd21f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03, skipping insertion in model container [2018-11-23 02:08:03,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:08:03,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:08:03,261 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:08:03,263 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:08:03,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:08:03,286 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:08:03,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03 WrapperNode [2018-11-23 02:08:03,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:08:03,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:08:03,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:08:03,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:08:03,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:08:03,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:08:03,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:08:03,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:08:03,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... [2018-11-23 02:08:03,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:08:03,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:08:03,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:08:03,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:08:03,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:08:03,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:08:03,489 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:08:03,489 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 02:08:03,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:03 BoogieIcfgContainer [2018-11-23 02:08:03,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:08:03,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:08:03,490 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:08:03,492 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:08:03,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:08:03,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:08:03" (1/3) ... [2018-11-23 02:08:03,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3df55e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:08:03, skipping insertion in model container [2018-11-23 02:08:03,494 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:08:03,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:03" (2/3) ... [2018-11-23 02:08:03,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3df55e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:08:03, skipping insertion in model container [2018-11-23 02:08:03,494 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:08:03,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:03" (3/3) ... [2018-11-23 02:08:03,496 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-23 02:08:03,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:08:03,536 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:08:03,536 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:08:03,536 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:08:03,536 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:08:03,537 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:08:03,537 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:08:03,537 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:08:03,537 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:08:03,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:08:03,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:03,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:03,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:03,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:08:03,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:03,563 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:08:03,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:08:03,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:03,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:03,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:03,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:08:03,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:03,569 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 5#L23-2true [2018-11-23 02:08:03,569 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 8#L25-2true assume !(main_~j~0 < main_~m~0); 7#L25-3true main_~i~0 := 1 + main_~i~0; 5#L23-2true [2018-11-23 02:08:03,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2018-11-23 02:08:03,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:03,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:03,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2018-11-23 02:08:03,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:03,641 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2018-11-23 02:08:03,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:03,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:03,700 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:03,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:03,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:03,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:03,701 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:03,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:03,702 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:03,702 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:03,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 02:08:03,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:03,702 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:03,721 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-23 02:08:03,734 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-23 02:08:03,737 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-23 02:08:03,747 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-23 02:08:03,843 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:03,844 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:03,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:03,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:03,884 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:03,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:03,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:03,904 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:03,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:03,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:03,911 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:03,930 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:03,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:03,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:04,040 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:04,041 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:04,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:04,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:04,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:04,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:04,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:04,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:04,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:04,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 02:08:04,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:04,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:04,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:08:04,045 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-23 02:08:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:08:04,051 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-23 02:08:04,098 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:04,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:04,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:08:04,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:04,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:04,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:04,111 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-23 02:08:04,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:04,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:04,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:04,120 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-23 02:08:04,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:04,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:04,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:04,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:04,124 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-23 02:08:04,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:04,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:04,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:04,128 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:04,132 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:04,133 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:04,134 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:04,134 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:04,134 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:04,134 INFO L520 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-23 02:08:04,135 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:04,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:04,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:04,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:04,194 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-23 02:08:04,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 02:08:04,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-11-23 02:08:04,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2018-11-23 02:08:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:08:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 02:08:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 02:08:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 02:08:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 02:08:04,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-23 02:08:04,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 02:08:04,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2018-11-23 02:08:04,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:08:04,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 02:08:04,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2018-11-23 02:08:04,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:04,256 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2018-11-23 02:08:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2018-11-23 02:08:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 02:08:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:08:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-11-23 02:08:04,275 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-23 02:08:04,275 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-23 02:08:04,275 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:08:04,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2018-11-23 02:08:04,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 02:08:04,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:04,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:04,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 02:08:04,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:08:04,276 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 98#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 99#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 104#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 96#L28-2 [2018-11-23 02:08:04,276 INFO L796 eck$LassoCheckResult]: Loop: 96#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 96#L28-2 [2018-11-23 02:08:04,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2018-11-23 02:08:04,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2018-11-23 02:08:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2018-11-23 02:08:04,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:04,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,316 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:04,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:04,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:04,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:04,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:04,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:04,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:04,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:04,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 02:08:04,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:04,316 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:04,317 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-23 02:08:04,320 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-23 02:08:04,322 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-23 02:08:04,351 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:04,351 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:04,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:04,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:04,368 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:04,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:04,385 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:04,385 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:04,388 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:04,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:04,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:04,512 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:04,513 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:04,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:04,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:04,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:04,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:04,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:04,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:04,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:04,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 02:08:04,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:04,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:04,515 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-23 02:08:04,518 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-23 02:08:04,522 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-23 02:08:04,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:04,576 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:04,576 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-23 02:08:04,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:04,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:04,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:04,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:08:04,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:04,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:04,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:04,591 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-23 02:08:04,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:04,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:04,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:04,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:04,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:04,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:04,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:04,597 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:04,600 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:08:04,600 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:04,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:04,601 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:04,601 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:04,601 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-23 02:08:04,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:04,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:04,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:04,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:04,628 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-23 02:08:04,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:08:04,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2018-11-23 02:08:04,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 27 states and 43 transitions. Complement of second has 6 states. [2018-11-23 02:08:04,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 02:08:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-23 02:08:04,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2018-11-23 02:08:04,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-23 02:08:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 02:08:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:04,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2018-11-23 02:08:04,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 02:08:04,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 02:08:04,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 02:08:04,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 02:08:04,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2018-11-23 02:08:04,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:04,647 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-23 02:08:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2018-11-23 02:08:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 02:08:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 02:08:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-11-23 02:08:04,649 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-23 02:08:04,649 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-23 02:08:04,649 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:08:04,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2018-11-23 02:08:04,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 02:08:04,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:04,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:04,651 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:08:04,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:04,652 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 181#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 182#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 180#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 188#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 175#L28-3 main_~i~0 := main_~k~0; 186#L25-2 [2018-11-23 02:08:04,652 INFO L796 eck$LassoCheckResult]: Loop: 186#L25-2 assume !(main_~j~0 < main_~m~0); 187#L25-3 main_~i~0 := 1 + main_~i~0; 189#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 186#L25-2 [2018-11-23 02:08:04,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2018-11-23 02:08:04,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:04,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2018-11-23 02:08:04,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2018-11-23 02:08:04,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:04,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:04,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:04,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:04,714 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:04,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:04,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:04,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:04,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:04,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:04,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:04,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:04,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 02:08:04,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:04,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:04,717 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-23 02:08:04,719 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-23 02:08:04,727 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-23 02:08:04,742 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-23 02:08:04,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:04,853 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:04,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:04,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:04,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:04,873 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:04,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:04,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:05,147 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:05,148 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:05,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:05,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:05,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:05,148 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:05,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:05,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:05,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 02:08:05,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:05,149 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:05,149 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-23 02:08:05,151 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-23 02:08:05,155 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-23 02:08:05,164 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-23 02:08:05,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:05,196 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:05,196 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-23 02:08:05,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:05,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:05,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:05,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:05,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:05,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:05,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:05,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:08:05,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:05,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:05,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:05,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:05,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:05,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:05,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:05,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:05,209 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:05,209 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:05,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:05,209 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:05,209 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:05,210 INFO L520 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-23 02:08:05,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:05,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,250 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-23 02:08:05,250 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 02:08:05,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-23 02:08:05,267 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 8 states. [2018-11-23 02:08:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:08:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 02:08:05,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 02:08:05,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 02:08:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 02:08:05,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2018-11-23 02:08:05,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 02:08:05,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2018-11-23 02:08:05,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 02:08:05,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 02:08:05,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2018-11-23 02:08:05,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:05,271 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-11-23 02:08:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2018-11-23 02:08:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 02:08:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:08:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-23 02:08:05,273 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 02:08:05,273 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 02:08:05,273 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:08:05,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-23 02:08:05,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 02:08:05,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:05,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:05,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-23 02:08:05,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:08:05,274 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 277#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 278#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 288#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 287#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 276#L28-3 main_~i~0 := main_~k~0; 286#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 273#L28-2 [2018-11-23 02:08:05,274 INFO L796 eck$LassoCheckResult]: Loop: 273#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 273#L28-2 [2018-11-23 02:08:05,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2018-11-23 02:08:05,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2018-11-23 02:08:05,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2018-11-23 02:08:05,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:08:05,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:08:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:08:05,329 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:05,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:05,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:05,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:05,330 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:05,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:05,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:05,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 02:08:05,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:05,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:05,331 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-23 02:08:05,334 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-23 02:08:05,346 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-23 02:08:05,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:05,376 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:05,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:05,394 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:05,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:05,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:05,397 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:05,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:05,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:05,522 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:05,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:05,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:05,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:05,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:05,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:05,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:05,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:05,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 02:08:05,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:05,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:05,525 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-23 02:08:05,529 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-23 02:08:05,531 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-23 02:08:05,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:05,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:05,556 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-23 02:08:05,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:05,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:05,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:05,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:05,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:05,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:05,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:05,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:05,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:08:05,560 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:05,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:05,561 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:05,561 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:05,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-23 02:08:05,562 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:05,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,587 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-23 02:08:05,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:08:05,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-23 02:08:05,596 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-11-23 02:08:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 02:08:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 02:08:05,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-23 02:08:05,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,596 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:08:05,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,622 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-23 02:08:05,622 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:08:05,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-23 02:08:05,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-11-23 02:08:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 02:08:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 02:08:05,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-23 02:08:05,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,630 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:08:05,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,659 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-23 02:08:05,659 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:08:05,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-23 02:08:05,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 36 states and 60 transitions. Complement of second has 5 states. [2018-11-23 02:08:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 02:08:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-23 02:08:05,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-23 02:08:05,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2018-11-23 02:08:05,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 02:08:05,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:05,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2018-11-23 02:08:05,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 02:08:05,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2018-11-23 02:08:05,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 02:08:05,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 02:08:05,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2018-11-23 02:08:05,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:05,672 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2018-11-23 02:08:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2018-11-23 02:08:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 02:08:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:08:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 02:08:05,674 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:08:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:08:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:08:05,676 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2018-11-23 02:08:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:08:05,702 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-11-23 02:08:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:08:05,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-23 02:08:05,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:05,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2018-11-23 02:08:05,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 02:08:05,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 02:08:05,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-23 02:08:05,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:05,703 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 02:08:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-23 02:08:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 02:08:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 02:08:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-11-23 02:08:05,704 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 02:08:05,704 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 02:08:05,704 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:08:05,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-11-23 02:08:05,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:05,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:05,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:05,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-23 02:08:05,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:05,705 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 533#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 534#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 540#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 539#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 528#L28-3 main_~i~0 := main_~k~0; 538#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-11-23 02:08:05,705 INFO L796 eck$LassoCheckResult]: Loop: 525#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 526#L28-3 main_~i~0 := main_~k~0; 530#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-11-23 02:08:05,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2018-11-23 02:08:05,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2018-11-23 02:08:05,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2018-11-23 02:08:05,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:05,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:05,762 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:05,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:05,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:05,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:05,762 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:05,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:05,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:05,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 02:08:05,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:05,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:05,763 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-23 02:08:05,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:08:05,771 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-23 02:08:05,773 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-23 02:08:05,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:05,800 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:05,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:05,801 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:05,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:05,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:05,924 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:05,926 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:05,926 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:05,926 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:05,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:05,926 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:05,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:05,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:05,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:05,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 02:08:05,927 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:05,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:05,928 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-23 02:08:05,930 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-23 02:08:05,933 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-23 02:08:05,935 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-23 02:08:05,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:05,964 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:05,965 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-23 02:08:05,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:05,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:05,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:05,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:05,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:05,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:05,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:05,968 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-23 02:08:05,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:05,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:05,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:05,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:05,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:05,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:05,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:05,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:05,977 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:05,977 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:05,977 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:05,977 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:05,978 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:05,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2018-11-23 02:08:05,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:05,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:05,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:05,998 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-23 02:08:05,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:08:05,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 02:08:06,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 5 states. [2018-11-23 02:08:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:08:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 02:08:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 02:08:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 02:08:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 02:08:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2018-11-23 02:08:06,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:06,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2018-11-23 02:08:06,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 02:08:06,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:08:06,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2018-11-23 02:08:06,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:06,008 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-23 02:08:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2018-11-23 02:08:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-23 02:08:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 02:08:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-11-23 02:08:06,010 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-11-23 02:08:06,010 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-11-23 02:08:06,010 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:08:06,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2018-11-23 02:08:06,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:06,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:06,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:06,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-23 02:08:06,011 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:06,011 INFO L794 eck$LassoCheckResult]: Stem: 640#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 635#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 636#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 637#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 651#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 647#L28-3 main_~i~0 := main_~k~0; 648#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 649#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 650#L28-3 main_~i~0 := main_~k~0; 655#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-11-23 02:08:06,011 INFO L796 eck$LassoCheckResult]: Loop: 641#L25-3 main_~i~0 := 1 + main_~i~0; 642#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 653#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-11-23 02:08:06,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2018-11-23 02:08:06,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2018-11-23 02:08:06,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2018-11-23 02:08:06,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 02:08:06,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:08:06,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:08:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:08:06,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:08:06,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:08:06,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 02:08:06,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:08:06,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 02:08:06,100 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:06,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:06,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:06,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:06,100 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:06,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:06,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:06,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:06,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 02:08:06,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:06,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:06,101 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-23 02:08:06,104 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-23 02:08:06,105 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-23 02:08:06,106 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-23 02:08:06,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:06,135 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:06,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:06,153 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:06,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:06,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:06,455 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:06,457 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:06,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:06,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:06,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:06,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:06,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:06,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:06,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:06,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 02:08:06,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:06,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:06,458 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-23 02:08:06,461 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-23 02:08:06,462 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-23 02:08:06,464 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-23 02:08:06,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:06,485 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:06,486 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-23 02:08:06,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:06,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:06,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:06,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:06,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:06,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:06,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:06,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:06,489 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:06,489 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:06,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:06,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:06,489 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:06,489 INFO L520 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-23 02:08:06,489 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:06,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:06,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:06,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:06,511 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-23 02:08:06,512 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-23 02:08:06,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 02:08:06,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 90 transitions. Complement of second has 7 states. [2018-11-23 02:08:06,524 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-23 02:08:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:08:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 02:08:06,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 02:08:06,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 02:08:06,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 02:08:06,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:06,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2018-11-23 02:08:06,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:08:06,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2018-11-23 02:08:06,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 02:08:06,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 02:08:06,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2018-11-23 02:08:06,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:06,528 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2018-11-23 02:08:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2018-11-23 02:08:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2018-11-23 02:08:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:08:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-11-23 02:08:06,531 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-11-23 02:08:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:08:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:08:06,531 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 6 states. [2018-11-23 02:08:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:08:06,562 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-11-23 02:08:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:08:06,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2018-11-23 02:08:06,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 02:08:06,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 49 transitions. [2018-11-23 02:08:06,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 02:08:06,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 02:08:06,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2018-11-23 02:08:06,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:06,565 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-11-23 02:08:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2018-11-23 02:08:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-11-23 02:08:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:08:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-23 02:08:06,566 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-23 02:08:06,567 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-23 02:08:06,567 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:08:06,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-11-23 02:08:06,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 02:08:06,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:06,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:06,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:08:06,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:08:06,568 INFO L794 eck$LassoCheckResult]: Stem: 909#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 907#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 908#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 916#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 917#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 901#L28-3 main_~i~0 := main_~k~0; 912#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-11-23 02:08:06,568 INFO L796 eck$LassoCheckResult]: Loop: 910#L25-3 main_~i~0 := 1 + main_~i~0; 902#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 903#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 898#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 899#L28-3 main_~i~0 := main_~k~0; 920#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-11-23 02:08:06,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2018-11-23 02:08:06,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:06,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2018-11-23 02:08:06,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:06,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2018-11-23 02:08:06,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:08:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:06,624 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:06,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:06,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:06,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:06,624 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:06,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:06,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:06,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:06,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 02:08:06,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:06,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08: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-23 02:08:06,632 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-23 02:08:06,636 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-23 02:08:06,638 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-23 02:08:06,670 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:06,670 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:06,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:06,672 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:06,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:06,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:14,254 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:14,256 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:14,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:14,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:14,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:14,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:14,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:14,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:14,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:14,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 02:08:14,257 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:14,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:14,258 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-23 02:08:14,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-23 02:08:14,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-23 02:08:14,267 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-23 02:08:14,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:14,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:14,295 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-23 02:08:14,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:14,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:14,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:14,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:14,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:14,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:14,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:14,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:14,299 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:14,299 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:14,299 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:14,299 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:14,299 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:14,299 INFO L520 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-23 02:08:14,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:14,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:08:14,336 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 02:08:14,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-23 02:08:14,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 49 states and 69 transitions. Complement of second has 7 states. [2018-11-23 02:08:14,351 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-23 02:08:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:08:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 02:08:14,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 02:08:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,352 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:08:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:08:14,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 02:08:14,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-23 02:08:14,426 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 56 states and 79 transitions. Complement of second has 10 states. [2018-11-23 02:08:14,426 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-23 02:08:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:08:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-23 02:08:14,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 02:08:14,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 02:08:14,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-23 02:08:14,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2018-11-23 02:08:14,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:08:14,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2018-11-23 02:08:14,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 02:08:14,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 02:08:14,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2018-11-23 02:08:14,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:08:14,430 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-11-23 02:08:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2018-11-23 02:08:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-23 02:08:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:08:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-11-23 02:08:14,432 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-23 02:08:14,432 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-23 02:08:14,432 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:08:14,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2018-11-23 02:08:14,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:08:14,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:08:14,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:08:14,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:08:14,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:08:14,433 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1158#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1159#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1174#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1171#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1168#L28-3 main_~i~0 := main_~k~0; 1167#L25-2 assume !(main_~j~0 < main_~m~0); 1161#L25-3 main_~i~0 := 1 + main_~i~0; 1154#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1155#L25-2 [2018-11-23 02:08:14,433 INFO L796 eck$LassoCheckResult]: Loop: 1155#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1150#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1151#L28-3 main_~i~0 := main_~k~0; 1155#L25-2 [2018-11-23 02:08:14,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2018-11-23 02:08:14,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,439 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2018-11-23 02:08:14,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:14,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2018-11-23 02:08:14,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:08:14,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:08:14,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:08:14,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:08:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:08:14,460 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:14,460 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:14,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:14,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:14,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:08:14,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:14,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:14,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:14,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 02:08:14,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:14,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:14,461 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-23 02:08:14,463 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-23 02:08:14,466 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-23 02:08:14,469 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-23 02:08:14,497 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:14,497 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:14,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:14,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:14,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:14,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:14,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:14,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:14,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:08:14,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=1} Honda state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:14,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:08:14,535 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_792c11fd-3911-452c-a420-f08e6e5c7cb2/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-23 02:08:14,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:08:14,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:08:14,670 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:08:14,672 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:08:14,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:08:14,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:08:14,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:08:14,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:08:14,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:08:14,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:08:14,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:08:14,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 02:08:14,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:08:14,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:08:14,673 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-23 02:08:14,675 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-23 02:08:14,679 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-23 02:08:14,682 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-23 02:08:14,706 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:08:14,706 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:08:14,706 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-23 02:08:14,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:14,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:14,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:14,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:14,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:08:14,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:08:14,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:08:14,709 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-23 02:08:14,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:08:14,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:08:14,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:08:14,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:08:14,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:08:14,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:08:14,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:08:14,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:08:14,713 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:08:14,713 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:08:14,713 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:08:14,714 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:08:14,714 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:08:14,714 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2018-11-23 02:08:14,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:08:14,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,743 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-23 02:08:14,743 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 02:08:14,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-23 02:08:14,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 55 states and 81 transitions. Complement of second has 5 states. [2018-11-23 02:08:14,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:08:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 02:08:14,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 02:08:14,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,748 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:08:14,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,766 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-23 02:08:14,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 02:08:14,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-23 02:08:14,778 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2018-11-23 02:08:14,778 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-23 02:08:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:08:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-23 02:08:14,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 02:08:14,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,779 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:08:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:08:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:08:14,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:08:14,798 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-23 02:08:14,798 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 02:08:14,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-23 02:08:14,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 69 states and 104 transitions. Complement of second has 4 states. [2018-11-23 02:08:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:08:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:08:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 02:08:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 02:08:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 02:08:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 02:08:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:08:14,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2018-11-23 02:08:14,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:08:14,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:08:14,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:08:14,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:08:14,813 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:08:14,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:08:14,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:08:14,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:08:14,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:08:14 BoogieIcfgContainer [2018-11-23 02:08:14,818 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:08:14,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:08:14,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:08:14,818 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:08:14,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:03" (3/4) ... [2018-11-23 02:08:14,821 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:08:14,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:08:14,821 INFO L168 Benchmark]: Toolchain (without parser) took 11711.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:08:14,822 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:08:14,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:08:14,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:08:14,823 INFO L168 Benchmark]: Boogie Preprocessor took 12.76 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:08:14,823 INFO L168 Benchmark]: RCFGBuilder took 170.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:08:14,823 INFO L168 Benchmark]: BuchiAutomizer took 11327.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:08:14,824 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:08:14,825 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.76 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11327.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + m and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.2s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 163 SDtfs, 160 SDslu, 63 SDs, 0 SdLazy, 133 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax170 hnf97 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...