./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2a421301cdbe97036a5fec0597ad83df33c3e561 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:57:12,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:57:12,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:57:12,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:57:12,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:57:12,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:57:12,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:57:12,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:57:12,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:57:12,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:57:12,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:57:12,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:57:12,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:57:12,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:57:12,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:57:12,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:57:12,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:57:12,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:57:12,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:57:12,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:57:12,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:57:12,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:57:12,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:57:12,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:57:12,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:57:12,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:57:12,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:57:12,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:57:12,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:57:12,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:57:12,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:57:12,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:57:12,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:57:12,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:57:12,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:57:12,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:57:12,329 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:57:12,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:57:12,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:57:12,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:57:12,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:57:12,342 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:57:12,342 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:57:12,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:57:12,343 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:57:12,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:57:12,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:57:12,344 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:57:12,345 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:57:12,345 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_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2018-11-23 15:57:12,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:57:12,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:57:12,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:57:12,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:57:12,378 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:57:12,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-11-23 15:57:12,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/data/8b2290b45/1786442b405f4d5188fadff61370ea65/FLAG97b42e2fd [2018-11-23 15:57:12,783 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:57:12,784 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/sv-benchmarks/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-11-23 15:57:12,794 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/data/8b2290b45/1786442b405f4d5188fadff61370ea65/FLAG97b42e2fd [2018-11-23 15:57:13,178 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/data/8b2290b45/1786442b405f4d5188fadff61370ea65 [2018-11-23 15:57:13,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:57:13,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:57:13,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:57:13,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:57:13,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:57:13,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92c2917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13, skipping insertion in model container [2018-11-23 15:57:13,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:57:13,213 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:57:13,391 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:57:13,399 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:57:13,424 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:57:13,497 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:57:13,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13 WrapperNode [2018-11-23 15:57:13,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:57:13,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:57:13,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:57:13,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:57:13,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:57:13,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:57:13,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:57:13,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:57:13,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... [2018-11-23 15:57:13,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:57:13,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:57:13,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:57:13,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:57:13,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c23dbf5-b92a-4072-bf9f-1db0948b870b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:57:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:57:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:57:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:57:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:57:13,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:57:13,710 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:57:13,710 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 15:57:13,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:13 BoogieIcfgContainer [2018-11-23 15:57:13,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:57:13,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:57:13,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:57:13,713 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:57:13,714 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:57:13,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:57:13" (1/3) ... [2018-11-23 15:57:13,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e24402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:57:13, skipping insertion in model container [2018-11-23 15:57:13,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:57:13,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:13" (2/3) ... [2018-11-23 15:57:13,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e24402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:57:13, skipping insertion in model container [2018-11-23 15:57:13,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:57:13,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:13" (3/3) ... [2018-11-23 15:57:13,717 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-termination.c.i [2018-11-23 15:57:13,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:57:13,757 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:57:13,757 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:57:13,757 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:57:13,757 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:57:13,757 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:57:13,757 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:57:13,757 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:57:13,757 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:57:13,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:57:13,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:57:13,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:13,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:13,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:57:13,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:57:13,786 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:57:13,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:57:13,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:57:13,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:13,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:13,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:57:13,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:57:13,793 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L565true assume !(main_~array_size~0 < 1); 9#L565-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 16#L552-3true [2018-11-23 15:57:13,793 INFO L796 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(test_fun_~i~0 < test_fun_~N); 13#L553-3true assume !true; 5#L557-2true assume !true; 14#L552-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 16#L552-3true [2018-11-23 15:57:13,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 15:57:13,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:13,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-11-23 15:57:13,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:13,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:57:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:57:13,899 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:57:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:57:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:57:13,911 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-23 15:57:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:57:13,916 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-23 15:57:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:57:13,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-23 15:57:13,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:57:13,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-23 15:57:13,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:57:13,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:57:13,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 15:57:13,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:57:13,922 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:57:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 15:57:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 15:57:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:57:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 15:57:13,939 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:57:13,939 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:57:13,939 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:57:13,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 15:57:13,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:57:13,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:13,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:13,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:57:13,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:57:13,940 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L565 assume !(main_~array_size~0 < 1); 39#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 40#L552-3 [2018-11-23 15:57:13,941 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 43#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 42#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L552-3 [2018-11-23 15:57:13,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 15:57:13,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:13,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-11-23 15:57:13,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:13,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:57:13,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-11-23 15:57:13,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:57:14,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:57:14,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:57:14,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:57:14,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:57:14,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:14,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:57:14,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:57:14,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 15:57:14,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:57:14,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:57:14,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-23 15:57:14,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:14,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:57:14,589 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:57:14,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:14,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:14,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:14,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,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-23 15:57:14,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:14,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:14,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:14,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:14,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:14,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:14,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:14,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:14,709 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:57:14,742 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:57:14,742 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:57:14,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:57:14,745 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:57:14,746 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:57:14,746 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-23 15:57:14,760 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:57:14,766 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:57:14,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:14,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:14,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:14,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:14,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 15:57:14,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-11-23 15:57:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:57:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 15:57:14,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 15:57:14,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:14,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 15:57:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:14,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 15:57:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:14,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-23 15:57:14,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:14,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2018-11-23 15:57:14,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:57:14,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:57:14,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 15:57:14,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:57:14,854 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 15:57:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 15:57:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-23 15:57:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 15:57:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-23 15:57:14,855 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 15:57:14,855 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 15:57:14,855 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:57:14,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-23 15:57:14,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:14,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:14,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:14,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:57:14,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:57:14,856 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 130#L565 assume !(main_~array_size~0 < 1); 132#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 133#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 136#L553-3 [2018-11-23 15:57:14,856 INFO L796 eck$LassoCheckResult]: Loop: 136#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 134#L553-1 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(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 136#L553-3 [2018-11-23 15:57:14,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 15:57:14,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:14,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:14,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-23 15:57:14,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-23 15:57:14,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:14,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:14,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,063 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:57:15,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:57:15,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:57:15,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:57:15,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:57:15,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:15,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:57:15,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:57:15,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:57:15,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:57:15,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:57:15,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57: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-23 15:57:15,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:57:15,354 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:57:15,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:57:15,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:57:15,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:57:15,402 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:57:15,402 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:57:15,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:57:15,403 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 15:57:15,403 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:57:15,403 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-23 15:57:15,424 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:57:15,425 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:57:15,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:15,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:15,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:15,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:15,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 15:57:15,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-11-23 15:57:15,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 15:57:15,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 15:57:15,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:15,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 15:57:15,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:15,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 15:57:15,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:15,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-23 15:57:15,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:15,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-11-23 15:57:15,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 15:57:15,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 15:57:15,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-23 15:57:15,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:57:15,472 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-23 15:57:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-23 15:57:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-23 15:57:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:57:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-23 15:57:15,474 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 15:57:15,474 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 15:57:15,474 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:57:15,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-23 15:57:15,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:15,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:15,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:15,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:57:15,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:57:15,475 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 234#L565 assume !(main_~array_size~0 < 1); 235#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 236#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 251#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 238#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 239#L557-2 [2018-11-23 15:57:15,476 INFO L796 eck$LassoCheckResult]: Loop: 239#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 242#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 239#L557-2 [2018-11-23 15:57:15,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-23 15:57:15,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-11-23 15:57:15,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:15,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-11-23 15:57:15,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:15,660 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:57:15,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:57:15,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:57:15,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:57:15,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:57:15,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:15,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:57:15,661 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:57:15,661 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 15:57:15,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:57:15,661 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:57:15,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:15,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:57:15,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:57:15,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:15,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:15,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:15,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:15,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:15,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:15,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:15,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:15,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:15,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:15,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:15,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,009 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:57:16,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:57:16,012 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:57:16,012 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:57:16,013 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:57:16,013 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:57:16,013 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-23 15:57:16,039 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:57:16,039 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:57:16,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:16,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:16,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 15:57:16,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-11-23 15:57:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:57:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 15:57:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 15:57:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 15:57:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-23 15:57:16,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:16,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-11-23 15:57:16,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:57:16,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 15:57:16,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-23 15:57:16,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:57:16,086 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-23 15:57:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-23 15:57:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 15:57:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 15:57:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-23 15:57:16,088 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 15:57:16,088 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 15:57:16,088 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:57:16,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-23 15:57:16,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:57:16,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:16,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:16,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:57:16,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:57:16,089 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 354#L565 assume !(main_~array_size~0 < 1); 356#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 357#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 362#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 373#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 372#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 364#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 365#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 366#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 360#L553-3 [2018-11-23 15:57:16,089 INFO L796 eck$LassoCheckResult]: Loop: 360#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 358#L553-1 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(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 360#L553-3 [2018-11-23 15:57:16,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-11-23 15:57:16,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-23 15:57:16,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:57:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-11-23 15:57:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:57:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,277 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:57:16,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:57:16,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:57:16,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:57:16,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:57:16,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:16,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:57:16,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:57:16,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 15:57:16,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:57:16,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:57:16,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:16,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:57:16,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:57:16,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:16,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:16,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:16,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:16,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:16,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:16,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:16,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:16,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:16,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:16,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:16,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:16,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:16,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:16,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:16,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:16,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:16,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:16,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:16,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:16,597 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:57:16,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:57:16,598 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:57:16,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:57:16,599 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 15:57:16,599 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:57:16,599 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)))_2) = -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)))_2 Supporting invariants [] [2018-11-23 15:57:16,628 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 15:57:16,629 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:57:16,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:16,676 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:16,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 15:57:16,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-23 15:57:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 15:57:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 15:57:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,716 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:57:16,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:16,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:16,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 15:57:16,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-23 15:57:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 15:57:16,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 15:57:16,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,781 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:57:16,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:16,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:16,813 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:16,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 15:57:16,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2018-11-23 15:57:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 15:57:16,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 15:57:16,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-23 15:57:16,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 15:57:16,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:16,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-11-23 15:57:16,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:57:16,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-11-23 15:57:16,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 15:57:16,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:57:16,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-23 15:57:16,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:57:16,840 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 15:57:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-23 15:57:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-23 15:57:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:57:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-23 15:57:16,842 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 15:57:16,842 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 15:57:16,842 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:57:16,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-23 15:57:16,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:57:16,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:57:16,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:57:16,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:57:16,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:57:16,844 INFO L794 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 653#L565 assume !(main_~array_size~0 < 1); 655#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~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_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 656#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 666#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 667#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 663#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 674#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 669#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 670#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 664#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 657#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 658#L557-2 [2018-11-23 15:57:16,844 INFO L796 eck$LassoCheckResult]: Loop: 658#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 658#L557-2 [2018-11-23 15:57:16,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-11-23 15:57:16,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:57:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-11-23 15:57:16,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:57:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-11-23 15:57:16,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:57:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:57:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:57:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:57:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:57:17,076 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-23 15:57:17,108 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:57:17,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:57:17,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:57:17,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:57:17,108 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:57:17,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:57:17,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:57:17,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:57:17,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 15:57:17,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:57:17,109 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:57:17,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:57:17,404 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:57:17,404 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:57:17,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-23 15:57:17,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:17,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:17,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:17,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:17,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:17,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:17,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:17,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:17,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:17,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:17,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:17,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:17,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:17,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:57:17,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:57:17,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:57:17,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:17,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:17,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:17,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:17,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:57:17,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:57:17,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:57:17,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:57:17,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:57:17,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:57:17,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:57:17,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:57:17,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:57:17,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:57:17,430 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:57:17,430 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:57:17,431 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:57:17,431 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:57:17,431 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))_4) = 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))_4 Supporting invariants [] [2018-11-23 15:57:17,467 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 15:57:17,468 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:57:17,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:17,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:17,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:57:17,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-23 15:57:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:57:17,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-23 15:57:17,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:17,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:57:17,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:17,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:17,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:57:17,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-23 15:57:17,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:57:17,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-23 15:57:17,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:17,565 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:57:17,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:57:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:57:17,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:57:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:57:17,589 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:57:17,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:57:17,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2018-11-23 15:57:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:57:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:57:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 15:57:17,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-23 15:57:17,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:17,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-23 15:57:17,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:17,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-23 15:57:17,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:57:17,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-23 15:57:17,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:57:17,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:57:17,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:57:17,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:57:17,602 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:57:17,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:57:17,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:57:17,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:57:17,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:57:17 BoogieIcfgContainer [2018-11-23 15:57:17,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:57:17,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:57:17,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:57:17,608 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:57:17,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:13" (3/4) ... [2018-11-23 15:57:17,610 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:57:17,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:57:17,611 INFO L168 Benchmark]: Toolchain (without parser) took 4430.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,611 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:57:17,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.29 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,613 INFO L168 Benchmark]: Boogie Preprocessor took 16.38 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,613 INFO L168 Benchmark]: RCFGBuilder took 170.73 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,614 INFO L168 Benchmark]: BuchiAutomizer took 3895.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.6 MB). Peak memory consumption was 143.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:57:17,614 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:57:17,617 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.29 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.38 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 170.73 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3895.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.6 MB). Peak memory consumption was 143.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] 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 3.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 93 SDslu, 9 SDs, 0 SdLazy, 106 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax112 hnf99 lsp79 ukn77 mio100 lsp53 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...