./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-5842f4b [2018-11-18 12:23:36,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:23:36,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:23:36,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:23:36,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:23:36,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:23:36,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:23:36,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:23:36,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:23:36,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:23:36,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:23:36,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:23:36,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:23:36,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:23:36,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:23:36,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:23:36,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:23:36,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:23:36,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:23:36,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:23:36,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:23:36,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:23:36,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:23:36,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:23:36,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:23:36,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:23:36,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:23:36,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:23:36,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:23:36,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:23:36,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:23:36,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:23:36,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:23:36,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:23:36,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:23:36,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:23:36,940 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:23:36,950 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:23:36,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:23:36,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:23:36,951 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:23:36,951 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:23:36,952 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:23:36,952 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:23:36,952 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:23:36,952 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:23:36,952 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:23:36,952 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:23:36,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:23:36,953 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:23:36,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:23:36,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:23:36,954 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:23:36,955 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:23:36,955 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:36,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:23:36,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:23:36,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:23:36,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:23:36,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:23:36,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-18 12:23:37,040 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/data/767f1546d/a9d73e44f17d4a2da2f50978d5f64135/FLAG793db8db9 [2018-11-18 12:23:37,370 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:23:37,370 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-18 12:23:37,374 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/data/767f1546d/a9d73e44f17d4a2da2f50978d5f64135/FLAG793db8db9 [2018-11-18 12:23:37,803 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/data/767f1546d/a9d73e44f17d4a2da2f50978d5f64135 [2018-11-18 12:23:37,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:23:37,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:23:37,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:37,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:23:37,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:23:37,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c4f020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37, skipping insertion in model container [2018-11-18 12:23:37,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:23:37,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:23:37,926 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:37,928 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:23:37,939 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:37,947 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:23:37,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37 WrapperNode [2018-11-18 12:23:37,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:37,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:23:37,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:23:37,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:23:37,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:23:37,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:23:37,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:23:37,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:23:37,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... [2018-11-18 12:23:37,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:23:37,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:23:37,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:23:37,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:23:37,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:23:38,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:23:38,175 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:23:38,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:38 BoogieIcfgContainer [2018-11-18 12:23:38,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:23:38,176 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:23:38,176 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:23:38,178 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:23:38,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:38,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:23:37" (1/3) ... [2018-11-18 12:23:38,180 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d4e3169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:23:38, skipping insertion in model container [2018-11-18 12:23:38,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:38,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:37" (2/3) ... [2018-11-18 12:23:38,180 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d4e3169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:23:38, skipping insertion in model container [2018-11-18 12:23:38,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:38,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:38" (3/3) ... [2018-11-18 12:23:38,181 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-18 12:23:38,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:23:38,223 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:23:38,223 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:23:38,223 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:23:38,223 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:23:38,223 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:23:38,224 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:23:38,224 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:23:38,224 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:23:38,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:23:38,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:38,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:38,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:38,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:23:38,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:23:38,254 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:23:38,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:23:38,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:38,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:38,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:38,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:23:38,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:23:38,261 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 7#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 4#L23-3true [2018-11-18 12:23:38,261 INFO L796 eck$LassoCheckResult]: Loop: 4#L23-3true assume true; 10#L23-1true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 11#L25-3true assume !true; 8#L25-4true main_~i~0 := 1 + main_~i~0; 4#L23-3true [2018-11-18 12:23:38,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-18 12:23:38,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:38,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1207369, now seen corresponding path program 1 times [2018-11-18 12:23:38,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:38,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:38,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:38,352 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-18 12:23:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:23:38,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:23:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:23:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:23:38,367 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 12:23:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:38,372 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-18 12:23:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:23:38,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-18 12:23:38,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:38,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 13 transitions. [2018-11-18 12:23:38,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:23:38,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:23:38,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-18 12:23:38,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:23:38,378 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 12:23:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-18 12:23:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 12:23:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 12:23:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 12:23:38,395 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 12:23:38,395 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 12:23:38,395 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:23:38,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 12:23:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:38,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:38,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:38,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:23:38,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:23:38,396 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 39#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 41#L23-3 [2018-11-18 12:23:38,396 INFO L796 eck$LassoCheckResult]: Loop: 41#L23-3 assume true; 46#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 47#L25-3 assume true; 48#L25-1 assume !(main_~j~0 < main_~m~0); 40#L25-4 main_~i~0 := 1 + main_~i~0; 41#L23-3 [2018-11-18 12:23:38,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times [2018-11-18 12:23:38,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:38,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 37406720, now seen corresponding path program 1 times [2018-11-18 12:23:38,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:38,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 119476223, now seen corresponding path program 1 times [2018-11-18 12:23:38,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:38,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:38,459 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:38,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:38,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:38,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:38,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:38,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:38,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:38,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:38,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-18 12:23:38,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:38,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:38,479 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-18 12:23:38,498 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-18 12:23:38,501 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-18 12:23:38,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-18 12:23:38,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:38,600 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:38,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:38,641 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:38,641 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:38,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:38,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:38,671 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:38,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:38,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:38,680 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:38,696 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:38,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:38,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:38,807 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:38,808 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:38,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:38,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:38,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:38,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:38,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:38,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:38,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:38,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-18 12:23:38,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:38,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:38,810 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-18 12:23:38,812 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-18 12:23:38,814 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-18 12:23:38,818 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-18 12:23:38,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:38,867 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:38,869 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-18 12:23:38,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:38,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:38,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:38,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:38,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:38,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:38,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:38,879 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-18 12:23:38,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:38,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:38,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:38,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:38,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:38,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:38,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:38,887 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-18 12:23:38,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:38,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:38,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:38,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:38,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:38,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:38,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:38,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:38,890 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-18 12:23:38,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:38,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:38,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:38,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:38,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:38,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:38,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:38,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:38,903 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:38,903 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:38,904 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:38,904 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:38,905 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:38,905 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-18 12:23:38,906 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:38,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:38,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:38,987 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-18 12:23:38,990 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-18 12:23:38,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 12:23:39,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 27 states and 33 transitions. Complement of second has 7 states. [2018-11-18 12:23:39,018 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-18 12:23:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 12:23:39,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-18 12:23:39,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-18 12:23:39,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-18 12:23:39,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2018-11-18 12:23:39,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 12:23:39,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2018-11-18 12:23:39,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 12:23:39,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:23:39,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-18 12:23:39,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:39,023 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-18 12:23:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-18 12:23:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-18 12:23:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 12:23:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-18 12:23:39,025 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 12:23:39,025 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 12:23:39,025 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:23:39,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-18 12:23:39,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:39,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:39,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:39,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:39,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:23:39,026 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 125#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 130#L23-3 assume true; 142#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 143#L25-3 assume true; 141#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 134#L28-3 [2018-11-18 12:23:39,026 INFO L796 eck$LassoCheckResult]: Loop: 134#L28-3 assume true; 132#L28-1 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 134#L28-3 [2018-11-18 12:23:39,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1804969390, now seen corresponding path program 1 times [2018-11-18 12:23:39,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1895, now seen corresponding path program 1 times [2018-11-18 12:23:39,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash -591202860, now seen corresponding path program 1 times [2018-11-18 12:23:39,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,064 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:39,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:39,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:39,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:39,065 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:39,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:39,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:39,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:39,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-18 12:23:39,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:39,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:39,066 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-18 12:23:39,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:39,069 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-18 12:23:39,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:39,096 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:39,113 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:39,131 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,133 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:39,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,258 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:39,259 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:39,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:39,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:39,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:39,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:39,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:39,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:39,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:39,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-18 12:23:39,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:39,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:39,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:39,264 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-18 12:23:39,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-18 12:23:39,308 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:39,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:39,308 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-18 12:23:39,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:39,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:39,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:39,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:39,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:39,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:39,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:39,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:39,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:39,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:39,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:39,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:39,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:23:39,328 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:39,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:39,328 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:39,328 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:39,328 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-18 12:23:39,329 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:39,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:39,377 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-18 12:23:39,377 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-18 12:23:39,377 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 12:23:39,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 36 states and 44 transitions. Complement of second has 5 states. [2018-11-18 12:23:39,395 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-18 12:23:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:23:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 12:23:39,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-18 12:23:39,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-18 12:23:39,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 12:23:39,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-18 12:23:39,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 12:23:39,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 37 transitions. [2018-11-18 12:23:39,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 12:23:39,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 12:23:39,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-18 12:23:39,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:39,399 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 12:23:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-18 12:23:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-18 12:23:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 12:23:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-18 12:23:39,402 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 12:23:39,402 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 12:23:39,402 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:23:39,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-18 12:23:39,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:39,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:39,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:39,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:39,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:23:39,404 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 228#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 233#L23-3 assume true; 247#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 250#L25-3 assume true; 249#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 248#L28-3 assume true; 235#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 236#L28-4 [2018-11-18 12:23:39,404 INFO L796 eck$LassoCheckResult]: Loop: 236#L28-4 main_~i~0 := main_~k~0; 239#L25-3 assume true; 240#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 245#L28-3 assume true; 246#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 236#L28-4 [2018-11-18 12:23:39,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash -591202862, now seen corresponding path program 1 times [2018-11-18 12:23:39,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash 65237456, now seen corresponding path program 1 times [2018-11-18 12:23:39,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1213626015, now seen corresponding path program 1 times [2018-11-18 12:23:39,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,462 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:39,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:39,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:39,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:39,462 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:39,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:39,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:39,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:39,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-18 12:23:39,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:39,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:39,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-18 12:23:39,468 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-18 12:23:39,473 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-18 12:23:39,475 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-18 12:23:39,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:39,522 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:39,543 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:39,552 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=-5, ULTIMATE.start_main_~i~0=-5, ULTIMATE.start_main_~N~0=-4} Honda state: {ULTIMATE.start_main_~k~0=-5, ULTIMATE.start_main_~i~0=-5, ULTIMATE.start_main_~N~0=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:39,584 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:39,587 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:39,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:39,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:39,710 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:39,711 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:39,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:39,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:39,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:39,712 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:39,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:39,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:39,712 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:39,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-18 12:23:39,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:39,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:39,713 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-18 12:23:39,715 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-18 12:23:39,732 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-18 12:23:39,736 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-18 12:23:39,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:39,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:39,770 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-18 12:23:39,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:39,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:39,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:39,776 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-18 12:23:39,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:39,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:39,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:39,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:39,784 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-18 12:23:39,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:39,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:39,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:39,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:39,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:39,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:39,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:39,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:39,791 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:39,791 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:39,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:39,792 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:39,792 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:39,792 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 12:23:39,792 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:39,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:39,834 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-18 12:23:39,834 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-18 12:23:39,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 12:23:39,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 55 transitions. Complement of second has 5 states. [2018-11-18 12:23:39,845 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-18 12:23:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-18 12:23:39,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 12:23:39,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-18 12:23:39,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 10 letters. [2018-11-18 12:23:39,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:39,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2018-11-18 12:23:39,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 12:23:39,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 52 transitions. [2018-11-18 12:23:39,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 12:23:39,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 12:23:39,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2018-11-18 12:23:39,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:39,849 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-11-18 12:23:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2018-11-18 12:23:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-18 12:23:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 12:23:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-11-18 12:23:39,852 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-18 12:23:39,852 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-18 12:23:39,852 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:23:39,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2018-11-18 12:23:39,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 12:23:39,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:39,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:39,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:39,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:23:39,854 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 359#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 364#L23-3 assume true; 386#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 391#L25-3 assume true; 390#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 389#L28-3 assume true; 385#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 392#L28-4 main_~i~0 := main_~k~0; 371#L25-3 assume true; 372#L25-1 assume !(main_~j~0 < main_~m~0); 360#L25-4 [2018-11-18 12:23:39,854 INFO L796 eck$LassoCheckResult]: Loop: 360#L25-4 main_~i~0 := 1 + main_~i~0; 361#L23-3 assume true; 375#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 376#L25-3 assume true; 393#L25-1 assume !(main_~j~0 < main_~m~0); 360#L25-4 [2018-11-18 12:23:39,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1136457145, now seen corresponding path program 1 times [2018-11-18 12:23:39,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash 68623700, now seen corresponding path program 2 times [2018-11-18 12:23:39,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 52886172, now seen corresponding path program 1 times [2018-11-18 12:23:39,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:39,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:23:39,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:23:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:39,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:39,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:23:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 12:23:39,971 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:39,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:39,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:39,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:39,972 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:39,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:39,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:39,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:39,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-18 12:23:39,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:39,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:39,973 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-18 12:23:39,977 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-18 12:23:39,981 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-18 12:23:39,983 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-18 12:23:40,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:40,025 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:40,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:40,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:40,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:40,035 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_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:40,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:40,051 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:40,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:40,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:40,416 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:40,417 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:40,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:40,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:40,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:40,418 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:40,418 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:40,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:40,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:40,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-18 12:23:40,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:40,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:40,419 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-18 12:23:40,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:40,426 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-18 12:23:40,428 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-18 12:23:40,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:40,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:40,453 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-18 12:23:40,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:40,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:40,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:40,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:40,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:40,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:40,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:40,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:40,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:40,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:40,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:40,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:40,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:40,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:40,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:40,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:40,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:40,461 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:40,461 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:40,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:40,462 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:40,462 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:40,462 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 12:23:40,462 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:40,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:40,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:40,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:40,490 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-18 12:23:40,490 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-18 12:23:40,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-18 12:23:40,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 87 states and 110 transitions. Complement of second has 7 states. [2018-11-18 12:23:40,514 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-18 12:23:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 12:23:40,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 12:23:40,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:40,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-18 12:23:40,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:40,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 12:23:40,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:40,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 110 transitions. [2018-11-18 12:23:40,517 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-18 12:23:40,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 69 states and 87 transitions. [2018-11-18 12:23:40,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 12:23:40,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 12:23:40,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2018-11-18 12:23:40,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:40,519 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-18 12:23:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2018-11-18 12:23:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-11-18 12:23:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 12:23:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-11-18 12:23:40,523 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-11-18 12:23:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:23:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:23:40,523 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 6 states. [2018-11-18 12:23:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:40,561 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-11-18 12:23:40,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:23:40,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 80 transitions. [2018-11-18 12:23:40,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 12:23:40,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 79 transitions. [2018-11-18 12:23:40,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 12:23:40,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 12:23:40,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 79 transitions. [2018-11-18 12:23:40,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:40,565 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-18 12:23:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 79 transitions. [2018-11-18 12:23:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2018-11-18 12:23:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 12:23:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-18 12:23:40,568 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-18 12:23:40,568 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-18 12:23:40,568 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:23:40,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-18 12:23:40,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:23:40,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:40,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:40,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:40,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:40,570 INFO L794 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 741#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 742#L23-3 assume true; 767#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 773#L25-3 assume true; 772#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 770#L28-3 assume true; 769#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 771#L28-4 main_~i~0 := main_~k~0; 757#L25-3 assume true; 758#L25-1 assume !(main_~j~0 < main_~m~0); 743#L25-4 [2018-11-18 12:23:40,570 INFO L796 eck$LassoCheckResult]: Loop: 743#L25-4 main_~i~0 := 1 + main_~i~0; 744#L23-3 assume true; 753#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 754#L25-3 assume true; 761#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 762#L28-3 assume true; 777#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 776#L28-4 main_~i~0 := main_~k~0; 775#L25-3 assume true; 774#L25-1 assume !(main_~j~0 < main_~m~0); 743#L25-4 [2018-11-18 12:23:40,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1136457145, now seen corresponding path program 2 times [2018-11-18 12:23:40,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:40,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 54265617, now seen corresponding path program 1 times [2018-11-18 12:23:40,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:40,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1351928119, now seen corresponding path program 2 times [2018-11-18 12:23:40,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:40,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:40,618 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:40,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:40,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:40,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:40,618 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:40,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:40,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:40,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:40,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-18 12:23:40,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:40,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:40,635 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-18 12:23:40,642 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-18 12:23:40,651 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-18 12:23:40,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:40,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:40,684 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:40,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:40,686 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:40,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:40,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:52,732 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 12:23:52,734 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:52,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:52,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:52,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:52,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:52,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:52,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:52,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:52,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-18 12:23:52,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:52,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:52,736 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-18 12:23:52,741 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-18 12:23:52,744 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-18 12:23:52,745 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-18 12:23:52,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:52,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:52,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:52,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:52,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:52,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:52,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:52,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:52,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:52,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:52,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:52,779 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:23:52,779 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:52,779 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:52,779 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:52,779 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:52,779 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-18 12:23:52,779 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:52,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,825 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-18 12:23:52,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 6 states. [2018-11-18 12:23:52,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 86 states and 107 transitions. Complement of second has 7 states. [2018-11-18 12:23:52,848 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-18 12:23:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:23:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 12:23:52,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 12:23:52,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:52,849 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:23:52,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:52,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:52,913 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-18 12:23:52,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 6 states. [2018-11-18 12:23:52,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 99 states and 126 transitions. Complement of second has 10 states. [2018-11-18 12:23:52,972 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-18 12:23:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:23:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-18 12:23:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 12:23:52,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 12:23:52,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-18 12:23:52,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:52,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 126 transitions. [2018-11-18 12:23:52,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-18 12:23:52,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 93 states and 119 transitions. [2018-11-18 12:23:52,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 12:23:52,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 12:23:52,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 119 transitions. [2018-11-18 12:23:52,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:52,976 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-18 12:23:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 119 transitions. [2018-11-18 12:23:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-11-18 12:23:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 12:23:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2018-11-18 12:23:52,980 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-18 12:23:52,980 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-18 12:23:52,980 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:23:52,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 104 transitions. [2018-11-18 12:23:52,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 12:23:52,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:52,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:52,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:52,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:23:52,982 INFO L794 eck$LassoCheckResult]: Stem: 1150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 1142#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1143#L23-3 assume true; 1188#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1187#L25-3 assume true; 1185#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1183#L28-3 assume true; 1174#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 1175#L28-4 main_~i~0 := main_~k~0; 1184#L25-3 assume true; 1182#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1176#L28-3 assume true; 1177#L28-1 [2018-11-18 12:23:52,982 INFO L796 eck$LassoCheckResult]: Loop: 1177#L28-1 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 1179#L28-3 assume true; 1177#L28-1 [2018-11-18 12:23:52,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 870433218, now seen corresponding path program 2 times [2018-11-18 12:23:52,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:52,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2075, now seen corresponding path program 2 times [2018-11-18 12:23:52,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:52,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1032299108, now seen corresponding path program 1 times [2018-11-18 12:23:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:52,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:23:53,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:53,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:53,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:53,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:53,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:53,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:53,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:53,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:53,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:53,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:53,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-18 12:23:53,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:53,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:53,031 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-18 12:23:53,034 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-18 12:23:53,036 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-18 12:23:53,075 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:53,075 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:53,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:53,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:53,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:53,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:53,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:23:53,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:53,130 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:53,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:53,256 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:53,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:53,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:53,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:53,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:53,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:53,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:53,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:53,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:53,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-18 12:23:53,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:53,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:53,259 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-18 12:23:53,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:53,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:53,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:53,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:53,283 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-18 12:23:53,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:53,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:53,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:53,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:53,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:53,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:53,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:53,286 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-18 12:23:53,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:53,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:53,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:53,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:53,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:53,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:53,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:53,288 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:53,290 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:53,290 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:53,291 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:53,291 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:53,291 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:53,291 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-18 12:23:53,291 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:53,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,325 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-18 12:23:53,325 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-18 12:23:53,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-18 12:23:53,333 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 144 states and 175 transitions. Complement of second has 5 states. [2018-11-18 12:23:53,335 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-18 12:23:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:23:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-18 12:23:53,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-18 12:23:53,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,336 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:23:53,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,358 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-18 12:23:53,358 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-18 12:23:53,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-18 12:23:53,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 133 states and 160 transitions. Complement of second has 7 states. [2018-11-18 12:23:53,369 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-18 12:23:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:23:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 12:23:53,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-18 12:23:53,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,370 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:23:53,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,388 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-18 12:23:53,388 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-18 12:23:53,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-18 12:23:53,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 157 states and 205 transitions. Complement of second has 6 states. [2018-11-18 12:23:53,395 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-18 12:23:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:23:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-18 12:23:53,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-18 12:23:53,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-18 12:23:53,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-18 12:23:53,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 205 transitions. [2018-11-18 12:23:53,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:23:53,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 86 states and 112 transitions. [2018-11-18 12:23:53,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 12:23:53,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 12:23:53,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 112 transitions. [2018-11-18 12:23:53,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:53,400 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2018-11-18 12:23:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 112 transitions. [2018-11-18 12:23:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2018-11-18 12:23:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 12:23:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2018-11-18 12:23:53,403 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 105 transitions. [2018-11-18 12:23:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:53,404 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand 4 states. [2018-11-18 12:23:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:53,428 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-18 12:23:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:23:53,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 75 transitions. [2018-11-18 12:23:53,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:23:53,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 75 transitions. [2018-11-18 12:23:53,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 12:23:53,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 12:23:53,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 75 transitions. [2018-11-18 12:23:53,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:53,430 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-18 12:23:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 75 transitions. [2018-11-18 12:23:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-18 12:23:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 12:23:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-18 12:23:53,432 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-18 12:23:53,432 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-18 12:23:53,432 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:23:53,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 75 transitions. [2018-11-18 12:23:53,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:23:53,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:53,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:53,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:53,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:23:53,433 INFO L794 eck$LassoCheckResult]: Stem: 1983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1975#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#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; 1976#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1982#L23-3 assume true; 2015#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 2016#L25-3 assume true; 2012#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 2010#L28-3 assume true; 2009#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 2007#L28-4 main_~i~0 := main_~k~0; 2005#L25-3 assume true; 2004#L25-1 assume !(main_~j~0 < main_~m~0); 1977#L25-4 main_~i~0 := 1 + main_~i~0; 1979#L23-3 assume true; 2002#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1992#L25-3 [2018-11-18 12:23:53,433 INFO L796 eck$LassoCheckResult]: Loop: 1992#L25-3 assume true; 1993#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1997#L28-3 assume true; 1984#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 1985#L28-4 main_~i~0 := main_~k~0; 1992#L25-3 [2018-11-18 12:23:53,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1032346056, now seen corresponding path program 3 times [2018-11-18 12:23:53,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 46949756, now seen corresponding path program 2 times [2018-11-18 12:23:53,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:53,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:53,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:53,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash -720959067, now seen corresponding path program 4 times [2018-11-18 12:23:53,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:53,460 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:53,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:53,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:53,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:53,461 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:23:53,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:53,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:53,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:53,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-18 12:23:53,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:53,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:53,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-18 12:23:53,468 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-18 12:23:53,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-18 12:23:53,471 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-18 12:23:53,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:53,504 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:23:53,507 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd29be2-9df6-45f8-8085-fa6837f9df93/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-18 12:23:53,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:23:53,524 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:23:53,630 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:23:53,631 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:53,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:53,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:53,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:53,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:53,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:53,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:53,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:53,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-18 12:23:53,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:53,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:53,633 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-18 12:23:53,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-18 12:23:53,637 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-18 12:23:53,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-18 12:23:53,670 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:53,670 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:53,670 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-18 12:23:53,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:53,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:53,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:53,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:53,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:53,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:53,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:53,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:53,675 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:53,675 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:23:53,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:53,675 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:23:53,675 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:53,676 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-18 12:23:53,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:23:53,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,708 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-18 12:23:53,708 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-18 12:23:53,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 12:23:53,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 99 states and 118 transitions. Complement of second has 5 states. [2018-11-18 12:23:53,715 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-18 12:23:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-18 12:23:53,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 12:23:53,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,716 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:23:53,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,739 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-18 12:23:53,739 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-18 12:23:53,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 12:23:53,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 98 states and 113 transitions. Complement of second has 7 states. [2018-11-18 12:23:53,761 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-18 12:23:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 12:23:53,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 12:23:53,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:23:53,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:53,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:53,788 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-18 12:23:53,788 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-18 12:23:53,788 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 12:23:53,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 118 states and 143 transitions. Complement of second has 4 states. [2018-11-18 12:23:53,799 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-18 12:23:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:23:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-18 12:23:53,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 12:23:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-18 12:23:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-18 12:23:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:53,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 143 transitions. [2018-11-18 12:23:53,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:23:53,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2018-11-18 12:23:53,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:23:53,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:23:53,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:23:53,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:23:53,802 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:53,802 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:53,802 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:53,802 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:23:53,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:23:53,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:23:53,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:23:53,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:23:53 BoogieIcfgContainer [2018-11-18 12:23:53,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:23:53,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:23:53,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:23:53,808 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:23:53,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:38" (3/4) ... [2018-11-18 12:23:53,810 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:23:53,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:23:53,811 INFO L168 Benchmark]: Toolchain (without parser) took 16004.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 953.8 MB in the beginning and 959.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 199.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:53,812 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:53,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:53,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.01 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:53,813 INFO L168 Benchmark]: Boogie Preprocessor took 12.86 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:53,813 INFO L168 Benchmark]: RCFGBuilder took 193.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:53,814 INFO L168 Benchmark]: BuchiAutomizer took 15631.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 959.4 MB in the end (delta: 142.5 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:53,814 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 959.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:53,816 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 20.01 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 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.86 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15631.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 959.4 MB in the end (delta: 142.5 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 959.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (3 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function -1 * i + n 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 3 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 14.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 81 states and ocurred in iteration 6. Nontrivial modules had stage [4, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 255 SDtfs, 241 SDslu, 132 SDs, 0 SdLazy, 136 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax170 hnf97 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf92 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...