./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/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_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/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-aa41828 [2018-11-22 22:47:49,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:47:49,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:47:49,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:47:49,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:47:49,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:47:49,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:47:49,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:47:49,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:47:49,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:47:49,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:47:49,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:47:49,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:47:49,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:47:49,626 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:47:49,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:47:49,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:47:49,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:47:49,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:47:49,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:47:49,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:47:49,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:47:49,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:47:49,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:47:49,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:47:49,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:47:49,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:47:49,636 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:47:49,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:47:49,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:47:49,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:47:49,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:47:49,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:47:49,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:47:49,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:47:49,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:47:49,639 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:47:49,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:47:49,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:47:49,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:47:49,650 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:47:49,650 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:47:49,650 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:47:49,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:47:49,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:47:49,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:47:49,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:47:49,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:47:49,653 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:47:49,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:47:49,653 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:47:49,653 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:47:49,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:47:49,654 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_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/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-11-22 22:47:49,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:47:49,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:47:49,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:47:49,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:47:49,688 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:47:49,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-11-22 22:47:49,724 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/data/006d76b2c/f93615e80c9e47b283839e960e2e9bc6/FLAG6a1e3926c [2018-11-22 22:47:50,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:47:50,111 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/sv-benchmarks/c/termination-15/count_up_alloca_true-termination.c.i [2018-11-22 22:47:50,118 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/data/006d76b2c/f93615e80c9e47b283839e960e2e9bc6/FLAG6a1e3926c [2018-11-22 22:47:50,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/data/006d76b2c/f93615e80c9e47b283839e960e2e9bc6 [2018-11-22 22:47:50,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:47:50,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:47:50,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:47:50,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:47:50,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:47:50,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212141c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50, skipping insertion in model container [2018-11-22 22:47:50,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:47:50,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:47:50,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:47:50,395 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:47:50,480 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:47:50,520 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:47:50,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50 WrapperNode [2018-11-22 22:47:50,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:47:50,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:47:50,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:47:50,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:47:50,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:47:50,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:47:50,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:47:50,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:47:50,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... [2018-11-22 22:47:50,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:47:50,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:47:50,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:47:50,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:47:50,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:47:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:47:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:47:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:47:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:47:50,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:47:50,802 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:47:50,802 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 22:47:50,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:47:50 BoogieIcfgContainer [2018-11-22 22:47:50,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:47:50,803 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:47:50,803 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:47:50,805 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:47:50,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:47:50,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:47:50" (1/3) ... [2018-11-22 22:47:50,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b688b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:47:50, skipping insertion in model container [2018-11-22 22:47:50,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:47:50,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:47:50" (2/3) ... [2018-11-22 22:47:50,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b688b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:47:50, skipping insertion in model container [2018-11-22 22:47:50,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:47:50,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:47:50" (3/3) ... [2018-11-22 22:47:50,809 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2018-11-22 22:47:50,854 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:47:50,855 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:47:50,855 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:47:50,855 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:47:50,855 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:47:50,855 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:47:50,856 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:47:50,856 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:47:50,856 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:47:50,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:47:50,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-22 22:47:50,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:50,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:50,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:47:50,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:47:50,888 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:47:50,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:47:50,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-22 22:47:50,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:50,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:50,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:47:50,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:47:50,895 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-11-22 22:47:50,895 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-11-22 22:47:50,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-22 22:47:50,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:50,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-22 22:47:50,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:50,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:50,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-11-22 22:47:50,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,187 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:47:51,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:47:51,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:47:51,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:47:51,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:47:51,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:51,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:47:51,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:47:51,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-22 22:47:51,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:47:51,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:47:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:51,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-11-22 22:47:51,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-11-22 22:47:51,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-11-22 22:47:51,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-11-22 22:47:51,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:47:51,510 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:47:51,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:51,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:51,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:51,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:51,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:51,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:51,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:51,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:51,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:51,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:51,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:51,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:47:51,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:51,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:51,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:47:51,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:51,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:51,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:51,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:51,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:51,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:51,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:51,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:51,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:51,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:51,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:51,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:51,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:51,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:51,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:51,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:51,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:51,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:51,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:51,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-11-22 22:47:51,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:51,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:51,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:51,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:51,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:51,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:51,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:47:51,643 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-22 22:47:51,643 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:47:51,645 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:47:51,646 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:47:51,647 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:47:51,647 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-11-22 22:47:51,669 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:47:51,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:51,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:51,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:51,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:47:51,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-22 22:47:51,777 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-11-22 22:47:51,778 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-11-22 22:47:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:47:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-22 22:47:51,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:47:51,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:51,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-22 22:47:51,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:51,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 22:47:51,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:51,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-11-22 22:47:51,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:51,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-22 22:47:51,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:47:51,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:47:51,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-22 22:47:51,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:47:51,791 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-22 22:47:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-22 22:47:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-22 22:47:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-22 22:47:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-22 22:47:51,808 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-22 22:47:51,808 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-22 22:47:51,808 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:47:51,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-22 22:47:51,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:51,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:51,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:51,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:51,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:47:51,809 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-11-22 22:47:51,809 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-11-22 22:47:51,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-11-22 22:47:51,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:51,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:51,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:47:51,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:47:51,858 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:47:51,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-11-22 22:47:51,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:51,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:47:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:47:51,887 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-22 22:47:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:47:51,903 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-22 22:47:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:47:51,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-22 22:47:51,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:51,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-11-22 22:47:51,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 22:47:51,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:47:51,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-22 22:47:51,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:47:51,905 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-22 22:47:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-22 22:47:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-22 22:47:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-22 22:47:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-22 22:47:51,906 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-22 22:47:51,906 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-22 22:47:51,906 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:47:51,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-22 22:47:51,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:51,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:51,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:51,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:51,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:47:51,908 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-11-22 22:47:51,908 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-11-22 22:47:51,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-11-22 22:47:51,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-11-22 22:47:51,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:51,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-11-22 22:47:51,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:51,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:51,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:51,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,078 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:47:52,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:47:52,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:47:52,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:47:52,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:47:52,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:52,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:47:52,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:47:52,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-22 22:47:52,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:47:52,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:47:52,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:47:52,305 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:47:52,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:52,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:52,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:52,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:52,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,324 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:47:52,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,325 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:47:52,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:52,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:52,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:52,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:52,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:52,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:52,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:52,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:52,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:52,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:52,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:52,367 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:47:52,383 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:47:52,383 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:47:52,383 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:47:52,385 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 22:47:52,385 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:47:52,385 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 2 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 4 >= 0] [2018-11-22 22:47:52,408 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:47:52,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:52,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:52,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 22:47:52,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 22:47:52,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:52,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-22 22:47:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:52,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:52,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-22 22:47:52,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-22 22:47:52,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 35 states and 45 transitions. Complement of second has 12 states. [2018-11-22 22:47:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-22 22:47:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 22:47:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-22 22:47:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 22:47:52,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:52,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 22:47:52,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:52,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-22 22:47:52,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:52,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2018-11-22 22:47:52,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:47:52,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 44 transitions. [2018-11-22 22:47:52,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:47:52,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-22 22:47:52,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-22 22:47:52,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:47:52,692 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-22 22:47:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-22 22:47:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-22 22:47:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 22:47:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-22 22:47:52,695 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-22 22:47:52,695 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-22 22:47:52,695 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:47:52,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-22 22:47:52,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:47:52,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:52,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:52,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:52,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:47:52,696 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#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; 337#L369 assume !(main_~length~0 < 1); 343#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; 340#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 341#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 344#L374 assume !(main_~val~0 > main_~limit~0); 351#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 350#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 349#L372-3 assume !(main_~i~0 < main_~length~0); 346#L372-4 main_~j~0 := 0; 333#L379-3 assume !!(main_~j~0 < main_~length~0); 329#L380-3 [2018-11-22 22:47:52,696 INFO L796 eck$LassoCheckResult]: Loop: 329#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 330#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~mem212;havoc main_#t~post213; 329#L380-3 [2018-11-22 22:47:52,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-11-22 22:47:52,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:52,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-11-22 22:47:52,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:52,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-11-22 22:47:52,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:52,921 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-11-22 22:47:52,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:47:52,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:47:52,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:47:52,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:47:52,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:47:52,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:52,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:47:52,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:47:52,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2018-11-22 22:47:52,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:47:52,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:47:52,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:52,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,224 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:47:53,224 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:47:53,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:53,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:53,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:53,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:53,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:53,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:53,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:53,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:53,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:53,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:53,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:53,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:53,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:53,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:53,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:53,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:53,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:53,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:53,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:53,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:53,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:53,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:53,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:53,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:53,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:47:53,252 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:47:53,252 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:47:53,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:47:53,253 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:47:53,253 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:47:53,254 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))_2) = 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))_2 Supporting invariants [] [2018-11-22 22:47:53,283 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:47:53,284 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:47:53,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:53,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:53,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:53,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:47:53,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-22 22:47:53,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 7 states. [2018-11-22 22:47:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:47:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:47:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 22:47:53,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-22 22:47:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:53,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-22 22:47:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:53,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-22 22:47:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:53,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2018-11-22 22:47:53,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:47:53,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 48 transitions. [2018-11-22 22:47:53,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 22:47:53,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-22 22:47:53,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2018-11-22 22:47:53,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:47:53,365 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-22 22:47:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2018-11-22 22:47:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-22 22:47:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 22:47:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-11-22 22:47:53,367 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-22 22:47:53,367 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-22 22:47:53,367 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:47:53,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2018-11-22 22:47:53,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:47:53,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:53,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:53,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:53,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:47:53,373 INFO L794 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#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; 491#L369 assume !(main_~length~0 < 1); 499#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; 494#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 495#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 497#L374 assume !(main_~val~0 > main_~limit~0); 510#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 509#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 508#L372-3 assume !(main_~i~0 < main_~length~0); 507#L372-4 main_~j~0 := 0; 505#L379-3 assume !!(main_~j~0 < main_~length~0); 502#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 501#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 479#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 480#L379-3 assume !!(main_~j~0 < main_~length~0); 481#L380-3 [2018-11-22 22:47:53,373 INFO L796 eck$LassoCheckResult]: Loop: 481#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 482#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~mem212;havoc main_#t~post213; 481#L380-3 [2018-11-22 22:47:53,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-11-22 22:47:53,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:53,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:53,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:47:53,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c5f1fe-0397-49a4-b7c5-3e424bd8d8e4/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-11-22 22:47:53,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:47:53,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:47:53,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:47:53,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:53,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:47:53,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-22 22:47:53,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:47:53,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-11-22 22:47:53,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:53,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 22:47:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:47:53,573 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 17 Second operand 14 states. [2018-11-22 22:47:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:47:53,702 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-22 22:47:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 22:47:53,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-11-22 22:47:53,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:53,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 27 states and 34 transitions. [2018-11-22 22:47:53,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-22 22:47:53,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-22 22:47:53,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-22 22:47:53,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:47:53,704 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-22 22:47:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-22 22:47:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-22 22:47:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:47:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-22 22:47:53,706 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-22 22:47:53,706 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-22 22:47:53,706 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:47:53,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-22 22:47:53,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:47:53,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:53,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:53,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:53,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:47:53,707 INFO L794 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 653#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; 654#L369 assume !(main_~length~0 < 1); 660#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; 655#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 656#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 661#L374 assume !(main_~val~0 > main_~limit~0); 666#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 658#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 659#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 650#L374 assume !(main_~val~0 > main_~limit~0); 651#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 652#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 665#L372-3 assume !(main_~i~0 < main_~length~0); 662#L372-4 main_~j~0 := 0; 663#L379-3 assume !!(main_~j~0 < main_~length~0); 664#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 647#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 648#L379-2 [2018-11-22 22:47:53,707 INFO L796 eck$LassoCheckResult]: Loop: 648#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 649#L379-3 assume !!(main_~j~0 < main_~length~0); 643#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 644#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 648#L379-2 [2018-11-22 22:47:53,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -983203256, now seen corresponding path program 1 times [2018-11-22 22:47:53,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2664470, now seen corresponding path program 3 times [2018-11-22 22:47:53,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:47:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461475, now seen corresponding path program 3 times [2018-11-22 22:47:53,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:53,874 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2018-11-22 22:47:53,900 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:47:53,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:47:53,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:47:53,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:47:53,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:47:53,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:53,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:47:53,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:47:53,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-22 22:47:53,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:47:53,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:47:53,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:53,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:47:54,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:47:54,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,126 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:47:54,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:47:54,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:47:54,169 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 22:47:54,170 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-22 22:47:54,170 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:47:54,171 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:47:54,171 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:47:54,171 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-22 22:47:54,181 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:47:54,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:54,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:54,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:54,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 22:47:54,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-22 22:47:54,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2018-11-22 22:47:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:47:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:47:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-22 22:47:54,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-22 22:47:54,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:54,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-22 22:47:54,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:54,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-22 22:47:54,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:54,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-11-22 22:47:54,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:47:54,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 36 transitions. [2018-11-22 22:47:54,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 22:47:54,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-22 22:47:54,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-22 22:47:54,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:47:54,243 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-22 22:47:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-22 22:47:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-22 22:47:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:47:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-22 22:47:54,244 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-22 22:47:54,244 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-22 22:47:54,244 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:47:54,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-11-22 22:47:54,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:47:54,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:47:54,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:47:54,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:47:54,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:47:54,247 INFO L794 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#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; 819#L369 assume !(main_~length~0 < 1); 825#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; 821#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 822#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 815#L374 assume !(main_~val~0 > main_~limit~0); 816#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 817#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 823#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 824#L374 assume !(main_~val~0 > main_~limit~0); 832#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 831#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 830#L372-3 assume !(main_~i~0 < main_~length~0); 828#L372-4 main_~j~0 := 0; 812#L379-3 assume !!(main_~j~0 < main_~length~0); 813#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 829#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 809#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 810#L379-3 assume !!(main_~j~0 < main_~length~0); 814#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 806#L380-1 [2018-11-22 22:47:54,247 INFO L796 eck$LassoCheckResult]: Loop: 806#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~mem212;havoc main_#t~post213; 805#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 806#L380-1 [2018-11-22 22:47:54,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1068815382, now seen corresponding path program 4 times [2018-11-22 22:47:54,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:54,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2652, now seen corresponding path program 3 times [2018-11-22 22:47:54,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:54,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:54,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:54,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash 634400049, now seen corresponding path program 1 times [2018-11-22 22:47:54,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:47:54,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:47:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:47:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:47:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:47:54,507 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2018-11-22 22:47:54,543 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:47:54,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:47:54,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:47:54,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:47:54,544 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:47:54,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:47:54,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:47:54,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:47:54,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration7_Lasso [2018-11-22 22:47:54,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:47:54,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:47:54,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,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-11-22 22:47:54,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-11-22 22:47:54,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-11-22 22:47:54,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-11-22 22:47:54,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:47:54,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:47:54,812 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:47:54,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:47:54,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:47:54,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:47:54,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,831 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:47:54,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:47:54,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:47:54,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:47:54,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-11-22 22:47:54,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:47:54,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:47:54,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:47:54,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:47:54,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:47:54,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:47:54,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:47:54,859 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:47:54,859 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:47:54,860 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:47:54,860 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 22:47:54,862 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:47:54,862 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))_4) = 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))_4 Supporting invariants [1*ULTIMATE.start_main_#t~mem211 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2 >= 0] [2018-11-22 22:47:54,873 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-22 22:47:54,877 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:47:54,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:54,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:54,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:54,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:54,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-11-22 22:47:54,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:47:54,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:54,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2018-11-22 22:47:54,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:47:54,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:54,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:54,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:27 [2018-11-22 22:47:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:54,948 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:47:54,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 22:47:54,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 33 states and 40 transitions. Complement of second has 6 states. [2018-11-22 22:47:54,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-22 22:47:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:47:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 22:47:54,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-22 22:47:54,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:54,980 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:47:54,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:55,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:55,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:55,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:55,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-11-22 22:47:55,021 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:47:55,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:55,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2018-11-22 22:47:55,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:27 [2018-11-22 22:47:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:55,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:47:55,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 22:47:55,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-11-22 22:47:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:47:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:47:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-22 22:47:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-22 22:47:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:55,070 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:47:55,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:47:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:55,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:47:55,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:47:55,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:55,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-11-22 22:47:55,104 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:47:55,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:47:55,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2018-11-22 22:47:55,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:47:55,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:27 [2018-11-22 22:47:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:47:55,124 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:47:55,124 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 22:47:55,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 5 states. [2018-11-22 22:47:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-22 22:47:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:47:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-22 22:47:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-22 22:47:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-22 22:47:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-22 22:47:55,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:47:55,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-11-22 22:47:55,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:47:55,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:47:55,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:47:55,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:47:55,152 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:47:55,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:47:55,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:47:55,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:47:55,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:47:55 BoogieIcfgContainer [2018-11-22 22:47:55,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:47:55,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:47:55,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:47:55,158 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:47:55,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:47:50" (3/4) ... [2018-11-22 22:47:55,161 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:47:55,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:47:55,162 INFO L168 Benchmark]: Toolchain (without parser) took 5031.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -235.7 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:47:55,163 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:47:55,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:47:55,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:47:55,164 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:47:55,165 INFO L168 Benchmark]: RCFGBuilder took 225.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:47:55,165 INFO L168 Benchmark]: BuchiAutomizer took 4355.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.3 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:47:55,166 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:47:55,168 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4355.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.3 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 7 terminating modules (2 trivial, 4 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 + -4 * j + 2 and consists of 9 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 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 4.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 124 SDtfs, 260 SDslu, 84 SDs, 0 SdLazy, 197 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf98 lsp94 ukn79 mio100 lsp54 div100 bol100 ite100 ukn100 eq162 hnf90 smp91 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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...