./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/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 32bit --witnessprinter.graph.data.programhash 9a031a295ba45c7116aee95a6abc238e63986cbf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:03:13,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:03:13,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:03:13,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:03:13,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:03:13,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:03:13,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:03:13,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:03:13,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:03:13,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:03:13,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:03:13,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:03:13,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:03:13,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:03:13,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:03:13,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:03:13,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:03:13,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:03:13,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:03:13,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:03:13,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:03:13,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:03:13,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:03:13,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:03:13,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:03:13,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:03:13,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:03:13,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:03:13,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:03:13,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:03:13,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:03:13,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:03:13,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:03:13,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:03:13,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:03:13,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:03:13,532 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:03:13,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:03:13,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:03:13,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:03:13,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:03:13,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:03:13,545 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:03:13,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:03:13,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:03:13,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:03:13,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:03:13,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:03:13,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:03:13,548 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:03:13,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:03:13,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:03:13,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:03:13,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:03:13,550 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_27ed15e4-8866-47b9-bb76-b4062788dd08/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a031a295ba45c7116aee95a6abc238e63986cbf [2018-11-18 09:03:13,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:03:13,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:03:13,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:03:13,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:03:13,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:03:13,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:03:13,618 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/data/c520ef85a/4d2d5da978ef4e1580890fb7302727cb/FLAG2a4f0a52a [2018-11-18 09:03:14,052 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:03:14,053 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:03:14,059 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/data/c520ef85a/4d2d5da978ef4e1580890fb7302727cb/FLAG2a4f0a52a [2018-11-18 09:03:14,067 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/data/c520ef85a/4d2d5da978ef4e1580890fb7302727cb [2018-11-18 09:03:14,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:03:14,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:03:14,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:03:14,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:03:14,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:03:14,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209e89ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14, skipping insertion in model container [2018-11-18 09:03:14,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:03:14,112 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:03:14,293 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:03:14,300 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:03:14,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:03:14,405 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:03:14,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14 WrapperNode [2018-11-18 09:03:14,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:03:14,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:03:14,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:03:14,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:03:14,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:03:14,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:03:14,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:03:14,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:03:14,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... [2018-11-18 09:03:14,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:03:14,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:03:14,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:03:14,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:03:14,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27ed15e4-8866-47b9-bb76-b4062788dd08/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:03:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:03:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:03:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:03:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:03:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:03:14,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:03:14,616 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:03:14,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:03:14 BoogieIcfgContainer [2018-11-18 09:03:14,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:03:14,617 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:03:14,617 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:03:14,620 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:03:14,620 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:03:14,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:03:14" (1/3) ... [2018-11-18 09:03:14,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58c048bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:03:14, skipping insertion in model container [2018-11-18 09:03:14,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:03:14,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:03:14" (2/3) ... [2018-11-18 09:03:14,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58c048bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:03:14, skipping insertion in model container [2018-11-18 09:03:14,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:03:14,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:03:14" (3/3) ... [2018-11-18 09:03:14,622 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:03:14,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:03:14,659 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:03:14,659 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:03:14,659 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:03:14,660 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:03:14,660 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:03:14,660 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:03:14,660 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:03:14,660 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:03:14,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 09:03:14,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:03:14,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:03:14,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:03:14,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:03:14,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:03:14,688 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:03:14,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 09:03:14,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:03:14,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:03:14,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:03:14,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:03:14,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:03:14,694 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L554true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L554-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 13#L544-4true [2018-11-18 09:03:14,695 INFO L796 eck$LassoCheckResult]: Loop: 13#L544-4true assume true; 5#L544-1true assume !!(test_fun_~i~0 < test_fun_~N); 11#L545-4true assume !true; 12#L544-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 13#L544-4true [2018-11-18 09:03:14,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 09:03:14,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:14,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1329096, now seen corresponding path program 1 times [2018-11-18 09:03:14,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:14,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:14,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:03:14,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:03:14,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:03:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:03:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:03:14,810 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 09:03:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:03:14,814 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-18 09:03:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:03:14,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-18 09:03:14,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:03:14,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 12 transitions. [2018-11-18 09:03:14,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 09:03:14,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 09:03:14,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-18 09:03:14,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:03:14,823 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 09:03:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-18 09:03:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-18 09:03:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 09:03:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-18 09:03:14,843 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 09:03:14,843 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-18 09:03:14,843 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:03:14,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-18 09:03:14,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:03:14,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:03:14,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:03:14,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:03:14,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:03:14,844 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 42#L544-4 [2018-11-18 09:03:14,844 INFO L796 eck$LassoCheckResult]: Loop: 42#L544-4 assume true; 46#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 44#L545-4 assume true; 45#L545-1 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 47#L545-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 43#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 42#L544-4 [2018-11-18 09:03:14,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 09:03:14,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985358, now seen corresponding path program 1 times [2018-11-18 09:03:14,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:14,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:03:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042318, now seen corresponding path program 1 times [2018-11-18 09:03:14,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,041 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:03:15,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:03:15,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:03:15,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:03:15,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:03:15,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:03:15,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:03:15,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:03:15,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 09:03:15,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:03:15,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:03:15,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:03:15,393 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:03:15,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:15,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:15,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:15,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:15,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:15,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:15,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:15,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:15,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:15,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,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-11-18 09:03:15,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:15,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:15,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:15,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:15,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:15,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:15,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:15,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:15,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:15,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:15,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:15,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:15,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:15,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:15,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:15,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:03:15,529 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:03:15,529 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:03:15,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:03:15,533 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:03:15,533 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:03:15,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-18 09:03:15,554 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:03:15,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:15,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:15,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:15,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:03:15,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 09:03:15,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 20 transitions. Complement of second has 6 states. [2018-11-18 09:03:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:03:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:03:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 09:03:15,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 09:03:15,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:15,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-18 09:03:15,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:15,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-18 09:03:15,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:15,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-18 09:03:15,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:03:15,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-11-18 09:03:15,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 09:03:15,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:03:15,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-18 09:03:15,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:03:15,651 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 09:03:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-18 09:03:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 09:03:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:03:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 09:03:15,653 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 09:03:15,653 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 09:03:15,653 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:03:15,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 09:03:15,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:03:15,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:03:15,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:03:15,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:03:15,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:03:15,654 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 130#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 132#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 133#L544-4 assume true; 141#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 134#L545-4 [2018-11-18 09:03:15,654 INFO L796 eck$LassoCheckResult]: Loop: 134#L545-4 assume true; 135#L545-1 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 142#L545-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 134#L545-4 [2018-11-18 09:03:15,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 09:03:15,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:15,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash 51706, now seen corresponding path program 1 times [2018-11-18 09:03:15,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:15,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924625, now seen corresponding path program 1 times [2018-11-18 09:03:15,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:15,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:15,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:03:15,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:03:15,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:03:15,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:03:15,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:03:15,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:03:15,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:03:15,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:03:15,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 09:03:15,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:03:15,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:03:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:15,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:03:16,044 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:03:16,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,093 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:03:16,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:03:16,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:03:16,106 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:03:16,106 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:03:16,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:03:16,107 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:03:16,107 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:03:16,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-18 09:03:16,125 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:03:16,127 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:03:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:16,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:03:16,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 09:03:16,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 30 states and 36 transitions. Complement of second has 7 states. [2018-11-18 09:03:16,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:03:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:03:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 09:03:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 09:03:16,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 09:03:16,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 09:03:16,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2018-11-18 09:03:16,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:03:16,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 26 transitions. [2018-11-18 09:03:16,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:03:16,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:03:16,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-18 09:03:16,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:03:16,207 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 09:03:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-18 09:03:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-18 09:03:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 09:03:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 09:03:16,211 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 09:03:16,211 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 09:03:16,212 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:03:16,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-18 09:03:16,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:03:16,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:03:16,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:03:16,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:03:16,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:03:16,213 INFO L794 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 238#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 240#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 241#L544-4 assume true; 248#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 255#L545-4 assume true; 257#L545-1 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 254#L545-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 242#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 243#L544-4 assume true; 250#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 244#L545-4 [2018-11-18 09:03:16,213 INFO L796 eck$LassoCheckResult]: Loop: 244#L545-4 assume true; 245#L545-1 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 251#L545-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 244#L545-4 [2018-11-18 09:03:16,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash 574583319, now seen corresponding path program 2 times [2018-11-18 09:03:16,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:16,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:16,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:03:16,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 51706, now seen corresponding path program 2 times [2018-11-18 09:03:16,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:16,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:03:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1967003684, now seen corresponding path program 1 times [2018-11-18 09:03:16,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:03:16,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:03:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:03:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:03:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:03:16,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:03:16,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:03:16,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:03:16,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:03:16,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:03:16,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:03:16,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:03:16,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:03:16,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 09:03:16,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:03:16,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:03:16,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:03:16,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:03:16,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:03:16,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,687 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:03:16,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,688 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:03:16,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:03:16,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:03:16,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:03:16,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:03:16,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:03:16,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:03:16,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:03:16,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:03:16,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:03:16,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:03:16,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:03:16,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:03:16,699 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:03:16,699 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:03:16,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:03:16,700 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:03:16,700 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:03:16,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-18 09:03:16,741 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 09:03:16,742 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:03:16,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:16,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:03:16,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 09:03:16,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 7 states. [2018-11-18 09:03:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:03:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:03:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 09:03:16,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 09:03:16,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:03:16,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:16,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:03:16,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 09:03:16,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 7 states. [2018-11-18 09:03:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:03:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:03:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 09:03:16,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 09:03:16,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,831 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:03:16,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:03:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:03:16,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:03:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:03:16,864 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:03:16,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 09:03:16,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 31 states and 37 transitions. Complement of second has 6 states. [2018-11-18 09:03:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:03:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:03:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 09:03:16,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 09:03:16,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 09:03:16,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 09:03:16,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:03:16,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-11-18 09:03:16,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:03:16,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-18 09:03:16,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:03:16,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:03:16,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:03:16,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:03:16,882 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:03:16,882 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:03:16,882 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:03:16,882 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:03:16,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:03:16,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:03:16,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:03:16,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:03:16 BoogieIcfgContainer [2018-11-18 09:03:16,886 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:03:16,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:03:16,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:03:16,887 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:03:16,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:03:14" (3/4) ... [2018-11-18 09:03:16,890 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:03:16,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:03:16,890 INFO L168 Benchmark]: Toolchain (without parser) took 2820.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 955.8 MB in the beginning and 1.0 GB in the end (delta: -90.7 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:03:16,891 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:03:16,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:03:16,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.54 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-11-18 09:03:16,893 INFO L168 Benchmark]: Boogie Preprocessor took 14.77 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-11-18 09:03:16,893 INFO L168 Benchmark]: RCFGBuilder took 170.51 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:03:16,893 INFO L168 Benchmark]: BuchiAutomizer took 2269.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:03:16,894 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:03:16,897 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.54 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. * Boogie Preprocessor took 14.77 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 170.51 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2269.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 62 SDtfs, 48 SDslu, 11 SDs, 0 SdLazy, 44 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital135 mio100 ax100 hnf98 lsp90 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq176 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...