./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/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 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 10:09:36,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 10:09:36,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 10:09:36,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 10:09:36,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 10:09:36,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 10:09:36,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 10:09:36,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 10:09:36,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 10:09:36,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 10:09:36,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 10:09:36,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 10:09:36,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 10:09:36,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 10:09:36,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 10:09:36,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 10:09:36,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 10:09:36,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 10:09:36,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 10:09:36,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 10:09:36,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 10:09:36,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 10:09:36,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 10:09:36,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 10:09:36,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 10:09:36,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 10:09:36,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 10:09:36,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 10:09:36,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 10:09:36,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 10:09:36,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 10:09:36,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 10:09:36,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 10:09:36,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 10:09:36,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 10:09:36,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 10:09:36,414 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 10:09:36,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 10:09:36,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 10:09:36,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 10:09:36,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 10:09:36,422 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 10:09:36,422 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 10:09:36,422 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 10:09:36,422 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 10:09:36,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 10:09:36,423 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 10:09:36,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 10:09:36,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 10:09:36,424 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 10:09:36,425 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 10:09:36,425 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_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/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 -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2018-12-01 10:09:36,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 10:09:36,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 10:09:36,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 10:09:36,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 10:09:36,457 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 10:09:36,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-12-01 10:09:36,500 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/data/fb04390c5/41ec81ee71254379b7231fa2d99ff024/FLAGd8b73039a [2018-12-01 10:09:36,842 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 10:09:36,842 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-12-01 10:09:36,847 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/data/fb04390c5/41ec81ee71254379b7231fa2d99ff024/FLAGd8b73039a [2018-12-01 10:09:36,855 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/data/fb04390c5/41ec81ee71254379b7231fa2d99ff024 [2018-12-01 10:09:36,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 10:09:36,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 10:09:36,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 10:09:36,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 10:09:36,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 10:09:36,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:09:36" (1/1) ... [2018-12-01 10:09:36,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7209347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:36, skipping insertion in model container [2018-12-01 10:09:36,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:09:36" (1/1) ... [2018-12-01 10:09:36,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 10:09:36,881 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 10:09:37,027 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 10:09:37,034 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 10:09:37,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 10:09:37,144 INFO L195 MainTranslator]: Completed translation [2018-12-01 10:09:37,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37 WrapperNode [2018-12-01 10:09:37,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 10:09:37,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 10:09:37,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 10:09:37,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 10:09:37,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 10:09:37,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 10:09:37,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 10:09:37,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 10:09:37,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... [2018-12-01 10:09:37,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 10:09:37,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 10:09:37,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 10:09:37,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 10:09:37,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/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-12-01 10:09:37,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 10:09:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 10:09:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 10:09:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 10:09:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 10:09:37,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 10:09:37,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 10:09:37,333 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 10:09:37,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:09:37 BoogieIcfgContainer [2018-12-01 10:09:37,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 10:09:37,333 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 10:09:37,333 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 10:09:37,335 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 10:09:37,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 10:09:37,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 10:09:36" (1/3) ... [2018-12-01 10:09:37,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c2a20b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:09:37, skipping insertion in model container [2018-12-01 10:09:37,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 10:09:37,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:09:37" (2/3) ... [2018-12-01 10:09:37,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c2a20b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:09:37, skipping insertion in model container [2018-12-01 10:09:37,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 10:09:37,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:09:37" (3/3) ... [2018-12-01 10:09:37,338 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2018-12-01 10:09:37,368 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 10:09:37,369 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 10:09:37,369 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 10:09:37,369 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 10:09:37,369 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 10:09:37,369 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 10:09:37,369 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 10:09:37,369 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 10:09:37,369 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 10:09:37,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 10:09:37,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 10:09:37,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:37,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:37,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 10:09:37,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 10:09:37,395 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 10:09:37,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 10:09:37,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 10:09:37,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:37,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:37,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 10:09:37,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 10:09:37,401 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2018-12-01 10:09:37,402 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2018-12-01 10:09:37,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-01 10:09:37,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-12-01 10:09:37,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-12-01 10:09:37,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:37,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:37,620 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 10:09:37,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 10:09:37,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 10:09:37,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 10:09:37,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 10:09:37,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 10:09:37,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 10:09:37,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 10:09:37,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2018-12-01 10:09:37,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 10:09:37,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 10:09:37,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:37,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 10:09:37,830 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 10:09:37,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 10:09:37,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,838 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-12-01 10:09:37,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,841 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-12-01 10:09:37,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,843 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-12-01 10:09:37,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,846 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-12-01 10:09:37,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:37,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:37,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,855 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-12-01 10:09:37,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,857 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-12-01 10:09:37,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,860 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-12-01 10:09:37,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,863 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-12-01 10:09:37,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,866 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-12-01 10:09:37,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:37,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:37,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:37,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,868 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-12-01 10:09:37,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:37,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:37,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:37,875 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-12-01 10:09:37,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:37,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:37,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:37,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:37,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:37,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:37,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 10:09:37,943 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 10:09:37,943 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 10:09:37,945 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 10:09:37,946 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 10:09:37,946 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 10:09:37,947 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-01 10:09:37,953 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 10:09:37,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:37,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:37,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:38,006 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-12-01 10:09:38,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-12-01 10:09:38,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-12-01 10:09:38,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 10:09:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 10:09:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-01 10:09:38,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 10:09:38,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-01 10:09:38,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-01 10:09:38,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-12-01 10:09:38,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 10:09:38,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-01 10:09:38,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 10:09:38,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 10:09:38,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-01 10:09:38,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 10:09:38,053 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-01 10:09:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-01 10:09:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-01 10:09:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 10:09:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-01 10:09:38,070 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-01 10:09:38,070 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-01 10:09:38,070 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 10:09:38,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-01 10:09:38,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 10:09:38,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:38,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:38,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:09:38,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 10:09:38,072 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2018-12-01 10:09:38,072 INFO L796 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2018-12-01 10:09:38,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-12-01 10:09:38,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 10:09:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 10:09:38,101 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 10:09:38,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-12-01 10:09:38,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 10:09:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 10:09:38,130 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-01 10:09:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:09:38,148 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-01 10:09:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 10:09:38,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-01 10:09:38,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 10:09:38,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-12-01 10:09:38,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 10:09:38,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 10:09:38,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-01 10:09:38,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 10:09:38,150 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-01 10:09:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-01 10:09:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-01 10:09:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 10:09:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-01 10:09:38,151 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 10:09:38,151 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 10:09:38,151 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 10:09:38,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-01 10:09:38,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 10:09:38,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:38,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:38,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:09:38,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 10:09:38,152 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2018-12-01 10:09:38,153 INFO L796 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2018-12-01 10:09:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-12-01 10:09:38,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-12-01 10:09:38,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-12-01 10:09:38,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:09:38,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,334 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 10:09:38,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 10:09:38,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 10:09:38,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 10:09:38,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 10:09:38,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 10:09:38,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 10:09:38,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 10:09:38,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-01 10:09:38,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 10:09:38,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 10:09:38,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 10:09:38,551 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 10:09:38,551 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-12-01 10:09:38,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,553 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-12-01 10:09:38,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,554 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-12-01 10:09:38,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 10:09:38,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,557 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-12-01 10:09:38,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,558 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-12-01 10:09:38,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,561 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-12-01 10:09:38,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,562 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-12-01 10:09:38,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,564 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-12-01 10:09:38,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,565 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-12-01 10:09:38,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,566 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 10:09:38,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 10:09:38,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,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-12-01 10:09:38,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,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-12-01 10:09:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,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-12-01 10:09:38,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,581 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-12-01 10:09:38,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:38,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 10:09:38,601 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 10:09:38,602 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 10:09:38,602 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 10:09:38,603 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 10:09:38,603 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 10:09:38,603 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-01 10:09:38,614 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 10:09:38,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 10:09:38,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:38,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:38,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:38,646 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-12-01 10:09:38,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-01 10:09:38,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-12-01 10:09:38,658 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-12-01 10:09:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 10:09:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-01 10:09:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-01 10:09:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-01 10:09:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-01 10:09:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:38,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-01 10:09:38,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:38,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2018-12-01 10:09:38,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 10:09:38,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 10:09:38,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-12-01 10:09:38,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 10:09:38,660 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-01 10:09:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-12-01 10:09:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-12-01 10:09:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-01 10:09:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-01 10:09:38,661 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-01 10:09:38,661 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-01 10:09:38,661 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 10:09:38,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-01 10:09:38,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:38,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:38,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:38,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:09:38,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 10:09:38,662 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2018-12-01 10:09:38,662 INFO L796 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 283#L380-3 [2018-12-01 10:09:38,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-12-01 10:09:38,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-12-01 10:09:38,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-12-01 10:09:38,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:38,788 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 10:09:38,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 10:09:38,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 10:09:38,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 10:09:38,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 10:09:38,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 10:09:38,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 10:09:38,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 10:09:38,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2018-12-01 10:09:38,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 10:09:38,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 10:09:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:38,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 10:09:38,996 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 10:09:38,997 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-12-01 10:09:38,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:38,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:38,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:38,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:38,998 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-12-01 10:09:38,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:38,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:38,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:38,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:38,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:38,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,000 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-12-01 10:09:39,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:39,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:39,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:39,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,001 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-12-01 10:09:39,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 10:09:39,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 10:09:39,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 10:09:39,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 10:09:39,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:39,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 10:09:39,015 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 10:09:39,015 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 10:09:39,015 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 10:09:39,016 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 10:09:39,017 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 10:09:39,017 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2, ULTIMATE.start_main_~limit~0) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 + 1*ULTIMATE.start_main_~limit~0 Supporting invariants [] [2018-12-01 10:09:39,022 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 10:09:39,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 10:09:39,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,066 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 10:09:39,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 10:09:39,093 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2018-12-01 10:09:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 10:09:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 10:09:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-01 10:09:39,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-01 10:09:39,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-01 10:09:39,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-01 10:09:39,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-01 10:09:39,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:39,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-12-01 10:09:39,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 10:09:39,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 10:09:39,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-12-01 10:09:39,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 10:09:39,096 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-01 10:09:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-12-01 10:09:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-01 10:09:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-01 10:09:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-01 10:09:39,097 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-01 10:09:39,097 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-01 10:09:39,098 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 10:09:39,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-12-01 10:09:39,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:39,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:39,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:39,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:09:39,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 10:09:39,099 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 427#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 428#L369 assume !(main_~length~0 < 1); 435#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 431#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 432#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 425#L374 assume !(main_~val~0 > main_~limit~0); 426#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 429#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 433#L372-3 assume !(main_~i~0 < main_~length~0); 434#L372-4 main_~j~0 := 0; 423#L379-3 assume !!(main_~j~0 < main_~length~0); 424#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 436#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 417#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 418#L379-3 assume !!(main_~j~0 < main_~length~0); 419#L380-3 [2018-12-01 10:09:39,099 INFO L796 eck$LassoCheckResult]: Loop: 419#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 420#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 419#L380-3 [2018-12-01 10:09:39,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-12-01 10:09:39,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 10:09:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 10:09:39,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c482b5e2-1a24-4f17-85e9-fa318f0fd7d0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 10:09:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 10:09:39,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 10:09:39,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 10:09:39,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 10:09:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-12-01 10:09:39,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 10:09:39,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-12-01 10:09:39,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:09:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 10:09:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-01 10:09:39,273 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-12-01 10:09:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 10:09:39,415 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-01 10:09:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 10:09:39,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-12-01 10:09:39,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:39,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-12-01 10:09:39,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 10:09:39,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 10:09:39,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-12-01 10:09:39,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 10:09:39,416 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-01 10:09:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-12-01 10:09:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-01 10:09:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-01 10:09:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-01 10:09:39,417 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-01 10:09:39,417 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-01 10:09:39,417 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 10:09:39,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-01 10:09:39,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 10:09:39,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 10:09:39,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 10:09:39,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 10:09:39,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 10:09:39,418 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 571#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 572#L369 assume !(main_~length~0 < 1); 579#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 574#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 575#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 578#L374 assume !(main_~val~0 > main_~limit~0); 583#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 576#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 577#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 568#L374 assume !(main_~val~0 > main_~limit~0); 569#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 570#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 582#L372-3 assume !(main_~i~0 < main_~length~0); 581#L372-4 main_~j~0 := 0; 566#L379-3 assume !!(main_~j~0 < main_~length~0); 567#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 584#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 564#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 565#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 [2018-12-01 10:09:39,418 INFO L796 eck$LassoCheckResult]: Loop: 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 561#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 560#L380-3 [2018-12-01 10:09:39,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-12-01 10:09:39,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:09:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-12-01 10:09:39,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:39,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:09:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-12-01 10:09:39,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 10:09:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 10:09:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 10:09:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 10:09:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 10:09:39,621 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2018-12-01 10:09:39,651 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 10:09:39,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 10:09:39,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 10:09:39,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 10:09:39,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 10:09:39,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 10:09:39,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 10:09:39,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 10:09:39,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2018-12-01 10:09:39,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 10:09:39,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 10:09:39,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 10:09:39,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 10:09:39,837 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 10:09:39,837 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-12-01 10:09:39,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:39,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,845 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-12-01 10:09:39,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 10:09:39,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 10:09:39,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,850 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-12-01 10:09:39,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:39,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,855 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-12-01 10:09:39,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:39,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 10:09:39,858 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-12-01 10:09:39,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 10:09:39,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 10:09:39,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 10:09:39,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 10:09:39,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 10:09:39,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 10:09:39,862 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 10:09:39,864 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 10:09:39,864 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 10:09:39,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 10:09:39,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 10:09:39,865 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 10:09:39,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2018-12-01 10:09:39,871 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 10:09:39,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 10:09:39,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,903 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-12-01 10:09:39,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-01 10:09:39,913 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-01 10:09:39,914 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-12-01 10:09:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 10:09:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 10:09:39,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-01 10:09:39,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,914 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 10:09:39,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,942 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-12-01 10:09:39,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-01 10:09:39,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-01 10:09:39,951 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-12-01 10:09:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 10:09:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 10:09:39,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-01 10:09:39,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,952 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 10:09:39,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 10:09:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 10:09:39,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 10:09:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 10:09:39,984 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-12-01 10:09:39,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-01 10:09:39,993 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-12-01 10:09:39,994 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-12-01 10:09:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 10:09:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-01 10:09:39,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-01 10:09:39,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-12-01 10:09:39,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-01 10:09:39,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 10:09:39,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-12-01 10:09:39,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 10:09:39,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-12-01 10:09:39,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 10:09:39,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 10:09:39,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 10:09:39,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 10:09:39,996 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 10:09:39,996 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 10:09:39,996 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 10:09:39,996 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 10:09:39,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 10:09:39,997 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 10:09:39,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 10:09:40,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 10:09:40 BoogieIcfgContainer [2018-12-01 10:09:40,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 10:09:40,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 10:09:40,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 10:09:40,002 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 10:09:40,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:09:37" (3/4) ... [2018-12-01 10:09:40,005 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 10:09:40,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 10:09:40,006 INFO L168 Benchmark]: Toolchain (without parser) took 3149.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -54.4 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. [2018-12-01 10:09:40,007 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 10:09:40,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 10:09:40,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 10:09:40,008 INFO L168 Benchmark]: Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 10:09:40,008 INFO L168 Benchmark]: RCFGBuilder took 145.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-01 10:09:40,008 INFO L168 Benchmark]: BuchiAutomizer took 2668.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.0 MB). Peak memory consumption was 129.2 MB. Max. memory is 11.5 GB. [2018-12-01 10:09:40,009 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 10:09:40,011 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2668.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.0 MB). Peak memory consumption was 129.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[arr][arr] + limit and consists of 5 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 223 SDslu, 87 SDs, 0 SdLazy, 189 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital125 mio100 ax100 hnf98 lsp94 ukn79 mio100 lsp56 div100 bol100 ite100 ukn100 eq165 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 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...