./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/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 77498d00b446eec99f943fd8f68173cd9df2461a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:55,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:55,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:55,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:55,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:55,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:55,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:55,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:55,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:55,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:55,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:55,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:55,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:55,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:55,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:55,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:55,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:55,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:55,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:55,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:55,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:55,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:55,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:55,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:55,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:55,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:55,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:55,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:55,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:55,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:55,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:55,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:55,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:55,788 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:55,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:55,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:55,791 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:55,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:55,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:55,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:55,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:55,806 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:55,807 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:55,807 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:55,807 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:55,807 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:55,807 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:55,807 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:55,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:55,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:55,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:55,811 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:55,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:55,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:55,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:55,812 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:55,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:55,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:55,812 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:55,813 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:55,813 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_14149665-d2a4-4a78-baf4-015145f316c9/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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2018-10-27 06:06:55,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:55,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:55,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:55,878 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:55,878 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:55,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i [2018-10-27 06:06:55,933 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/data/87eb526f3/31cf2b02e075405eb80f1e06dd2df808/FLAG77a910ed5 [2018-10-27 06:06:56,387 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:56,388 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i [2018-10-27 06:06:56,397 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/data/87eb526f3/31cf2b02e075405eb80f1e06dd2df808/FLAG77a910ed5 [2018-10-27 06:06:56,410 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/bin-2019/uautomizer/data/87eb526f3/31cf2b02e075405eb80f1e06dd2df808 [2018-10-27 06:06:56,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:56,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:56,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:56,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:56,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:56,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9decb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56, skipping insertion in model container [2018-10-27 06:06:56,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:56,468 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:56,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:56,738 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:56,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:56,831 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:56,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56 WrapperNode [2018-10-27 06:06:56,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:56,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:56,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:56,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:56,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:56,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:56,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:56,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:56,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... [2018-10-27 06:06:56,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:56,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:56,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:56,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:56,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14149665-d2a4-4a78-baf4-015145f316c9/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-10-27 06:06:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:57,451 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:57,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:57 BoogieIcfgContainer [2018-10-27 06:06:57,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:57,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:57,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:57,456 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:57,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:57,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:56" (1/3) ... [2018-10-27 06:06:57,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64c0e7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:57, skipping insertion in model container [2018-10-27 06:06:57,459 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:57,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:56" (2/3) ... [2018-10-27 06:06:57,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64c0e7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:57, skipping insertion in model container [2018-10-27 06:06:57,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:57,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:57" (3/3) ... [2018-10-27 06:06:57,463 INFO L375 chiAutomizerObserver]: Analyzing ICFG array07_alloca_true-termination.c.i [2018-10-27 06:06:57,514 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:57,515 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:57,515 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:57,515 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:57,515 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:57,516 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:57,516 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:57,516 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:57,516 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:57,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:06:57,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:06:57,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:57,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:57,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:57,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:57,561 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:57,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:06:57,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:06:57,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:57,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:57,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:57,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:57,571 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 22#L367true assume !(main_~length~0 < 1); 5#L367-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 19#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L370-4true [2018-10-27 06:06:57,572 INFO L795 eck$LassoCheckResult]: Loop: 4#L370-4true assume true; 20#L370-1true assume !!(main_~i~0 < main_~length~0); 14#L371true SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 16#L371-1true havoc main_#t~nondet208; 23#L370-3true main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 4#L370-4true [2018-10-27 06:06:57,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-10-27 06:06:57,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 45961588, now seen corresponding path program 1 times [2018-10-27 06:06:57,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1986383444, now seen corresponding path program 1 times [2018-10-27 06:06:57,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,852 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:06:58,170 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-27 06:06:58,249 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:58,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:58,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:58,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:58,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:58,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:58,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:58,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:58,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:58,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:58,252 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,598 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-27 06:06:58,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,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-10-27 06:06:59,020 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 06:06:59,335 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:59,338 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:59,340 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-10-27 06:06:59,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:59,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:59,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:59,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,347 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-10-27 06:06:59,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:59,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:59,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:59,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,351 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-10-27 06:06:59,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:59,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:59,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:59,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,356 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-10-27 06:06:59,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:59,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:59,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,368 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-10-27 06:06:59,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:59,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:59,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,383 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-10-27 06:06:59,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:59,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:59,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:59,407 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-10-27 06:06:59,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:59,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:59,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:59,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:59,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:59,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:59,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:59,597 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:06:59,597 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:06:59,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:59,601 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:59,602 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:59,602 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-10-27 06:06:59,662 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:06:59,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:59,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:59,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:59,772 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-10-27 06:06:59,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2018-10-27 06:06:59,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 7 states. [2018-10-27 06:06:59,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:06:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-10-27 06:06:59,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 5 letters. [2018-10-27 06:06:59,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:59,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 10 letters. Loop has 5 letters. [2018-10-27 06:06:59,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:59,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 10 letters. [2018-10-27 06:06:59,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:59,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-10-27 06:06:59,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:06:59,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 19 states and 22 transitions. [2018-10-27 06:06:59,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-10-27 06:06:59,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:06:59,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-10-27 06:06:59,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:59,844 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:06:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-10-27 06:06:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-27 06:06:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:06:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-10-27 06:06:59,875 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:06:59,875 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:06:59,875 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:59,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-10-27 06:06:59,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:06:59,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:59,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:59,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:59,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:59,879 INFO L793 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 155#L367 assume !(main_~length~0 < 1); 147#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 148#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 141#L370-4 assume true; 143#L370-1 assume !(main_~i~0 < main_~length~0); 145#L370-5 main_~j~0 := 0; 146#L374-3 [2018-10-27 06:06:59,879 INFO L795 eck$LassoCheckResult]: Loop: 146#L374-3 assume true; 153#L374-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 149#L375 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L375 150#L375-1 main_#t~post210 := main_#t~mem209; 151#L375-2 SUMMARY for call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L375-2 152#L375-3 main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 146#L374-3 [2018-10-27 06:06:59,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 176703699, now seen corresponding path program 1 times [2018-10-27 06:06:59,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:59,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:06:59,933 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1928682281, now seen corresponding path program 1 times [2018-10-27 06:06:59,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:59,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:59,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:59,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:59,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:06:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:06:59,998 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:07:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:00,055 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-10-27 06:07:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:00,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-10-27 06:07:00,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:07:00,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2018-10-27 06:07:00,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:07:00,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:07:00,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-10-27 06:07:00,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:00,059 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 06:07:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-10-27 06:07:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-27 06:07:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:07:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-10-27 06:07:00,063 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-27 06:07:00,063 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-10-27 06:07:00,063 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:00,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-10-27 06:07:00,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:07:00,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:00,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:00,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:00,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:00,065 INFO L793 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 205#L367 assume !(main_~length~0 < 1); 195#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 196#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 191#L370-4 assume true; 192#L370-1 assume !!(main_~i~0 < main_~length~0); 207#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 208#L371-1 havoc main_#t~nondet208; 209#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 193#L370-4 assume true; 194#L370-1 assume !(main_~i~0 < main_~length~0); 197#L370-5 main_~j~0 := 0; 198#L374-3 [2018-10-27 06:07:00,065 INFO L795 eck$LassoCheckResult]: Loop: 198#L374-3 assume true; 202#L374-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 199#L375 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L375 200#L375-1 main_#t~post210 := main_#t~mem209; 201#L375-2 SUMMARY for call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L375-2 203#L375-3 main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 198#L374-3 [2018-10-27 06:07:00,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash -289757936, now seen corresponding path program 1 times [2018-10-27 06:07:00,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1928682281, now seen corresponding path program 2 times [2018-10-27 06:07:00,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1809692920, now seen corresponding path program 1 times [2018-10-27 06:07:00,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,419 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-10-27 06:07:00,465 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:00,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:00,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:00,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:00,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:00,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:00,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:00,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:00,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:07:00,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:00,466 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:00,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-10-27 06:07:00,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:00,831 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:00,831 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:00,832 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-10-27 06:07:00,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,835 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-10-27 06:07:00,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,842 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-10-27 06:07:00,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,844 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-10-27 06:07:00,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,849 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:00,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,851 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:00,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,861 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-10-27 06:07:00,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,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-10-27 06:07:00,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,878 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-10-27 06:07:00,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,902 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-10-27 06:07:00,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,910 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-10-27 06:07:00,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,926 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-10-27 06:07:00,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,933 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-10-27 06:07:00,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,935 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-10-27 06:07:00,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,942 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-10-27 06:07:00,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,949 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-10-27 06:07:00,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:00,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,952 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-10-27 06:07:00,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:00,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:00,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:00,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,962 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:07:00,963 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-10-27 06:07:00,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,964 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:00,964 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:00,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,966 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-10-27 06:07:00,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:00,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:00,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,974 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-10-27 06:07:00,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:00,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:00,977 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:00,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:00,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,979 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-10-27 06:07:00,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:00,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,980 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:00,985 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:00,985 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:07:00,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:00,996 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-10-27 06:07:00,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:00,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:00,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:00,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:01,000 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:01,000 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:07:01,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,003 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-10-27 06:07:01,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,004 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:01,009 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:01,009 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:07:01,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,038 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-10-27 06:07:01,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:01,048 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:01,048 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-10-27 06:07:01,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:01,128 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-10-27 06:07:01,129 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:07:01,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:01,130 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2018-10-27 06:07:01,131 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:01,132 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-10-27 06:07:01,209 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:07:01,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:01,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:01,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:01,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:01,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:01,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:01,577 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 06:07:01,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:01,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:01,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-10-27 06:07:01,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-27 06:07:01,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:01,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-10-27 06:07:01,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-10-27 06:07:01,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:01,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-10-27 06:07:01,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-27 06:07:01,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,942 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:01,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-27 06:07:01,975 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:204, output treesize:104 [2018-10-27 06:07:02,244 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-10-27 06:07:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:02,245 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-10-27 06:07:02,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-10-27 06:07:02,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 25 states and 28 transitions. Complement of second has 12 states. [2018-10-27 06:07:02,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-10-27 06:07:02,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2018-10-27 06:07:02,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2018-10-27 06:07:02,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 12 letters. [2018-10-27 06:07:02,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-10-27 06:07:02,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:02,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-10-27 06:07:02,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:02,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:02,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:02,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:02,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:02,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:02,722 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:02,722 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:02,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:02,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:02,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:02,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:02 BoogieIcfgContainer [2018-10-27 06:07:02,729 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:02,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:02,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:02,730 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:02,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:57" (3/4) ... [2018-10-27 06:07:02,735 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:02,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:02,735 INFO L168 Benchmark]: Toolchain (without parser) took 6321.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 80.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,736 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:02,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 932.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,737 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,738 INFO L168 Benchmark]: RCFGBuilder took 465.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,738 INFO L168 Benchmark]: BuchiAutomizer took 5277.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:02,739 INFO L168 Benchmark]: Witness Printer took 5.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:02,745 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 932.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5277.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 62 SDslu, 34 SDs, 0 SdLazy, 47 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf99 lsp92 ukn92 mio100 lsp55 div100 bol100 ite100 ukn100 eq172 hnf90 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...