./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/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 9016787135830d25851d4a1126db5f65005e4eb5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 00:34:12,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:34:12,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:34:12,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:34:12,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:34:12,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:34:12,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:34:12,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:34:12,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:34:12,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:34:12,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:34:12,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:34:12,199 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:34:12,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:34:12,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:34:12,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:34:12,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:34:12,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:34:12,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:34:12,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:34:12,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:34:12,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:34:12,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:34:12,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:34:12,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:34:12,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:34:12,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:34:12,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:34:12,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:34:12,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:34:12,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:34:12,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:34:12,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:34:12,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:34:12,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:34:12,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:34:12,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 00:34:12,216 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:34:12,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:34:12,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 00:34:12,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 00:34:12,217 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 00:34:12,217 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 00:34:12,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 00:34:12,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 00:34:12,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 00:34:12,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 00:34:12,219 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 00:34:12,220 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 00:34:12,220 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_ce1cd478-1d22-4aad-beef-39d9dad3882b/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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2018-12-02 00:34:12,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:34:12,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:34:12,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:34:12,246 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:34:12,246 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:34:12,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-12-02 00:34:12,281 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/data/b9f649913/82e2ef85672b4be2a7e69f8fc568b302/FLAG61b4e714b [2018-12-02 00:34:12,712 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:34:12,713 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-12-02 00:34:12,718 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/data/b9f649913/82e2ef85672b4be2a7e69f8fc568b302/FLAG61b4e714b [2018-12-02 00:34:12,726 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/data/b9f649913/82e2ef85672b4be2a7e69f8fc568b302 [2018-12-02 00:34:12,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:34:12,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:34:12,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:34:12,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:34:12,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:34:12,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:12,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12, skipping insertion in model container [2018-12-02 00:34:12,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:12,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:34:12,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:34:12,891 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:34:12,897 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:34:12,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:34:12,984 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:34:12,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12 WrapperNode [2018-12-02 00:34:12,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:34:12,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:34:12,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:34:12,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:34:12,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:12,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:34:13,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:34:13,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:34:13,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:34:13,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... [2018-12-02 00:34:13,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:34:13,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:34:13,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:34:13,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:34:13,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 00:34:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 00:34:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 00:34:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 00:34:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 00:34:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:34:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:34:13,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:34:13,196 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 00:34:13,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:13 BoogieIcfgContainer [2018-12-02 00:34:13,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:34:13,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 00:34:13,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 00:34:13,199 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 00:34:13,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 00:34:13,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 12:34:12" (1/3) ... [2018-12-02 00:34:13,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@272c8767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 12:34:13, skipping insertion in model container [2018-12-02 00:34:13,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 00:34:13,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:12" (2/3) ... [2018-12-02 00:34:13,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@272c8767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 12:34:13, skipping insertion in model container [2018-12-02 00:34:13,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 00:34:13,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:13" (3/3) ... [2018-12-02 00:34:13,204 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-termination.c.i [2018-12-02 00:34:13,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 00:34:13,248 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 00:34:13,248 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 00:34:13,248 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 00:34:13,248 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:34:13,249 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:34:13,249 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 00:34:13,249 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:34:13,249 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 00:34:13,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 00:34:13,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-02 00:34:13,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:13,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:13,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 00:34:13,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 00:34:13,277 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 00:34:13,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 00:34:13,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-02 00:34:13,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:13,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:13,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 00:34:13,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 00:34:13,283 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2018-12-02 00:34:13,283 INFO L796 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2018-12-02 00:34:13,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-02 00:34:13,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-12-02 00:34:13,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-12-02 00:34:13,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:13,505 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 00:34:13,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 00:34:13,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 00:34:13,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 00:34:13,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 00:34:13,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 00:34:13,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 00:34:13,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 00:34:13,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 00:34:13,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 00:34:13,507 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 00:34:13,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,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-12-02 00:34:13,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:13,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 00:34:13,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 00:34:13,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:13,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:13,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:13,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,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-12-02 00:34:13,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,817 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 00:34:13,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 00:34:13,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:13,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:13,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:13,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:13,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:13,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:13,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:13,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:13,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 00:34:13,858 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 00:34:13,858 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 00:34:13,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 00:34:13,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 00:34:13,861 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 00:34:13,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-12-02 00:34:13,867 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 00:34:13,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:13,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:13,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:13,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 00:34:13,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-12-02 00:34:13,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-12-02 00:34:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 00:34:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 00:34:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-02 00:34:13,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 00:34:13,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:13,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 00:34:13,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:13,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 00:34:13,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:13,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-12-02 00:34:13,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 00:34:13,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-02 00:34:13,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 00:34:13,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 00:34:13,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-02 00:34:13,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 00:34:13,975 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 00:34:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-02 00:34:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 00:34:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 00:34:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-02 00:34:13,992 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 00:34:13,992 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 00:34:13,992 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 00:34:13,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-02 00:34:13,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 00:34:13,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:13,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:13,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:34:13,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 00:34:13,994 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L551 assume !(main_~length~0 < 1); 138#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 134#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 135#L554-3 assume !(main_~i~0 < main_~length~0); 139#L554-4 main_~j~0 := 0; 127#L561-3 [2018-12-02 00:34:13,994 INFO L796 eck$LassoCheckResult]: Loop: 127#L561-3 assume !!(main_~j~0 < main_~length~0); 128#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 140#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 141#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 127#L561-3 [2018-12-02 00:34:13,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-12-02 00:34:13,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:13,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:34:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:34:14,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 00:34:14,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-12-02 00:34:14,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:34:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:34:14,060 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-02 00:34:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:34:14,077 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 00:34:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:34:14,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 00:34:14,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 00:34:14,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-12-02 00:34:14,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 00:34:14,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 00:34:14,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-02 00:34:14,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 00:34:14,079 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-02 00:34:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-02 00:34:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-02 00:34:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 00:34:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-02 00:34:14,080 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 00:34:14,080 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 00:34:14,080 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 00:34:14,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-02 00:34:14,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 00:34:14,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:14,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:14,081 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:34:14,081 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 00:34:14,081 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 173#L551 assume !(main_~length~0 < 1); 178#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 169#L556 assume !(main_~val~0 < 0); 170#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 171#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 177#L554-3 assume !(main_~i~0 < main_~length~0); 179#L554-4 main_~j~0 := 0; 167#L561-3 [2018-12-02 00:34:14,081 INFO L796 eck$LassoCheckResult]: Loop: 167#L561-3 assume !!(main_~j~0 < main_~length~0); 168#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 180#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 181#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L561-3 [2018-12-02 00:34:14,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-12-02 00:34:14,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-12-02 00:34:14,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-12-02 00:34:14,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:34:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,236 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 00:34:14,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 00:34:14,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 00:34:14,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 00:34:14,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 00:34:14,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 00:34:14,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 00:34:14,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 00:34:14,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 00:34:14,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 00:34:14,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 00:34:14,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,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-12-02 00:34:14,444 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 00:34:14,444 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 00:34:14,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,451 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 00:34:14,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,452 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 00:34:14,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,472 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 00:34:14,480 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 00:34:14,480 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 00:34:14,481 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 00:34:14,481 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 00:34:14,481 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 00:34:14,482 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-12-02 00:34:14,485 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 00:34:14,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:14,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:14,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:14,518 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 00:34:14,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 00:34:14,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2018-12-02 00:34:14,527 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-12-02 00:34:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 00:34:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 00:34:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 00:34:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 00:34:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-02 00:34:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:14,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-02 00:34:14,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:14,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2018-12-02 00:34:14,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 00:34:14,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 00:34:14,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-12-02 00:34:14,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 00:34:14,530 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-02 00:34:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-12-02 00:34:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-02 00:34:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 00:34:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-02 00:34:14,532 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 00:34:14,532 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 00:34:14,532 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 00:34:14,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-02 00:34:14,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:14,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:14,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:14,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:34:14,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 00:34:14,533 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 287#L551 assume !(main_~length~0 < 1); 293#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 288#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 289#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 283#L556 assume !(main_~val~0 < 0); 284#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 285#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 291#L554-3 assume !(main_~i~0 < main_~length~0); 292#L554-4 main_~j~0 := 0; 279#L561-3 assume !!(main_~j~0 < main_~length~0); 281#L562-3 [2018-12-02 00:34:14,533 INFO L796 eck$LassoCheckResult]: Loop: 281#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 294#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 281#L562-3 [2018-12-02 00:34:14,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-12-02 00:34:14,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-12-02 00:34:14,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-12-02 00:34:14,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:14,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:14,691 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 00:34:14,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 00:34:14,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 00:34:14,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 00:34:14,691 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 00:34:14,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 00:34:14,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 00:34:14,691 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 00:34:14,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 00:34:14,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 00:34:14,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 00:34:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:14,939 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 00:34:14,939 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 00:34:14,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:14,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:14,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:14,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,961 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 00:34:14,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,961 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 00:34:14,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:14,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:14,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:14,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:14,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:14,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:14,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:14,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:14,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 00:34:14,973 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 00:34:14,973 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 00:34:14,973 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 00:34:14,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 00:34:14,974 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 00:34:14,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2018-12-02 00:34:14,979 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 00:34:14,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 00:34:14,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 00:34:15,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 00:34:15,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2018-12-02 00:34:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 00:34:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 00:34:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-02 00:34:15,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-02 00:34:15,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 00:34:15,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-02 00:34:15,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-02 00:34:15,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:15,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-12-02 00:34:15,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 00:34:15,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 00:34:15,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-12-02 00:34:15,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 00:34:15,039 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-02 00:34:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-12-02 00:34:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 00:34:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 00:34:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-02 00:34:15,040 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 00:34:15,040 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 00:34:15,040 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 00:34:15,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-12-02 00:34:15,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:15,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:15,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:15,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:34:15,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 00:34:15,041 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 422#L551 assume !(main_~length~0 < 1); 427#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 423#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 424#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 418#L556 assume !(main_~val~0 < 0); 419#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 420#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 426#L554-3 assume !(main_~i~0 < main_~length~0); 428#L554-4 main_~j~0 := 0; 413#L561-3 assume !!(main_~j~0 < main_~length~0); 414#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 431#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L561-3 assume !!(main_~j~0 < main_~length~0); 417#L562-3 [2018-12-02 00:34:15,041 INFO L796 eck$LassoCheckResult]: Loop: 417#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 429#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 417#L562-3 [2018-12-02 00:34:15,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-12-02 00:34:15,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:15,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:15,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:34:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:34:15,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce1cd478-1d22-4aad-beef-39d9dad3882b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:34:15,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 00:34:15,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 00:34:15,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 00:34:15,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:34:15,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-12-02 00:34:15,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 00:34:15,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-12-02 00:34:15,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:15,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:34:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 00:34:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 00:34:15,212 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-12-02 00:34:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:34:15,375 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-02 00:34:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:34:15,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-12-02 00:34:15,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:15,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-12-02 00:34:15,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 00:34:15,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 00:34:15,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-12-02 00:34:15,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 00:34:15,377 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-02 00:34:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-12-02 00:34:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-02 00:34:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 00:34:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-02 00:34:15,378 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-02 00:34:15,378 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-02 00:34:15,378 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 00:34:15,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-02 00:34:15,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 00:34:15,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 00:34:15,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 00:34:15,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:34:15,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 00:34:15,379 INFO L794 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~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_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 565#L551 assume !(main_~length~0 < 1); 572#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 566#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 567#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 571#L556 assume !(main_~val~0 < 0); 580#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 570#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 561#L556 assume !(main_~val~0 < 0); 562#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 578#L554-3 assume !(main_~i~0 < main_~length~0); 575#L554-4 main_~j~0 := 0; 556#L561-3 assume !!(main_~j~0 < main_~length~0); 557#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 579#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 577#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 558#L561-3 assume !!(main_~j~0 < main_~length~0); 560#L562-3 [2018-12-02 00:34:15,379 INFO L796 eck$LassoCheckResult]: Loop: 560#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 573#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 560#L562-3 [2018-12-02 00:34:15,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-12-02 00:34:15,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:15,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:34:15,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-12-02 00:34:15,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:34:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-12-02 00:34:15,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:34:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:34:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:34:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:34:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:34:15,544 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-12-02 00:34:15,571 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 00:34:15,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 00:34:15,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 00:34:15,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 00:34:15,571 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 00:34:15,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 00:34:15,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 00:34:15,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 00:34:15,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-02 00:34:15,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 00:34:15,572 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 00:34:15,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 00:34:15,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 00:34:15,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 00:34:15,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:15,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:15,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:15,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 00:34:15,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 00:34:15,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 00:34:15,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 00:34:15,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 00:34:15,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 00:34:15,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 00:34:15,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 00:34:15,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 00:34:15,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 00:34:15,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 00:34:15,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 00:34:15,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 00:34:15,802 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 00:34:15,802 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 00:34:15,802 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 00:34:15,802 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 00:34:15,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2018-12-02 00:34:15,808 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 00:34:15,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 00:34:15,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 00:34:15,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 00:34:15,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-02 00:34:15,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 00:34:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 00:34:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 00:34:15,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 00:34:15,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,848 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 00:34:15,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 00:34:15,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 00:34:15,886 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-12-02 00:34:15,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 00:34:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 00:34:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 00:34:15,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 00:34:15,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,887 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 00:34:15,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:34:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:34:15,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:34:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:34:15,919 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 00:34:15,919 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 00:34:15,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-12-02 00:34:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 00:34:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 00:34:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-02 00:34:15,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 00:34:15,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-12-02 00:34:15,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-02 00:34:15,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 00:34:15,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-12-02 00:34:15,938 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 00:34:15,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 00:34:15,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 00:34:15,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 00:34:15,939 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 00:34:15,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:34:15,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 00:34:15,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 00:34:15,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 12:34:15 BoogieIcfgContainer [2018-12-02 00:34:15,943 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 00:34:15,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:34:15,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:34:15,944 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:34:15,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:13" (3/4) ... [2018-12-02 00:34:15,946 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 00:34:15,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:34:15,947 INFO L168 Benchmark]: Toolchain (without parser) took 3218.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 950.6 MB in the beginning and 825.0 MB in the end (delta: 125.7 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2018-12-02 00:34:15,947 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:34:15,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -121.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:34:15,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-02 00:34:15,948 INFO L168 Benchmark]: Boogie Preprocessor took 15.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:34:15,949 INFO L168 Benchmark]: RCFGBuilder took 170.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-02 00:34:15,949 INFO L168 Benchmark]: BuchiAutomizer took 2746.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.0 MB). Free memory was 1.0 GB in the beginning and 825.0 MB in the end (delta: 224.6 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:34:15,949 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 825.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:34:15,951 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -121.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2746.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.0 MB). Free memory was 1.0 GB in the beginning and 825.0 MB in the end (delta: 224.6 MB). Peak memory consumption was 332.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 825.0 MB. 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 220 SDslu, 86 SDs, 0 SdLazy, 184 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax114 hnf98 lsp81 ukn79 mio100 lsp57 div100 bol100 ite100 ukn100 eq162 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...