./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_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_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/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 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:34:13,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:34:13,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:34:13,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:34:13,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:34:13,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:34:13,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:34:13,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:34:13,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:34:13,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:34:13,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:34:13,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:34:13,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:34:13,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:34:13,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:34:13,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:34:13,080 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:34:13,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:34:13,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:34:13,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:34:13,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:34:13,083 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:34:13,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:34:13,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:34:13,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:34:13,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:34:13,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:34:13,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:34:13,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:34:13,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:34:13,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:34:13,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:34:13,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:34:13,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:34:13,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:34:13,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:34:13,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 10:34:13,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:34:13,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:34:13,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:34:13,098 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:34:13,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:34:13,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:34:13,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:34:13,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:34:13,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:34:13,100 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:34:13,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:34:13,100 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_de6c262d-02e4-4e46-8ff3-0725b870709d/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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2018-12-09 10:34:13,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:34:13,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:34:13,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:34:13,130 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:34:13,130 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:34:13,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-12-09 10:34:13,166 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/data/c345bec4b/59c45f9e5770466d97b0172f9668a263/FLAGea2d7be11 [2018-12-09 10:34:13,601 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:34:13,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-12-09 10:34:13,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/data/c345bec4b/59c45f9e5770466d97b0172f9668a263/FLAGea2d7be11 [2018-12-09 10:34:13,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/bin-2019/uautomizer/data/c345bec4b/59c45f9e5770466d97b0172f9668a263 [2018-12-09 10:34:13,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:34:13,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:34:13,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:34:13,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:34:13,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:34:13,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501fac56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13, skipping insertion in model container [2018-12-09 10:34:13,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:34:13,644 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:34:13,805 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:34:13,812 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:34:13,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:34:13,916 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:34:13,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13 WrapperNode [2018-12-09 10:34:13,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:34:13,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:34:13,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:34:13,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:34:13,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:34:13,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:34:13,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:34:13,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:34:13,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... [2018-12-09 10:34:13,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:34:13,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:34:13,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:34:13,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:34:13,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/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-09 10:34:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:34:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:34:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:34:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:34:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:34:13,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:34:14,097 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:34:14,097 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 10:34:14,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:34:14 BoogieIcfgContainer [2018-12-09 10:34:14,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:34:14,098 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:34:14,098 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:34:14,100 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:34:14,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:34:14,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:34:13" (1/3) ... [2018-12-09 10:34:14,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea366af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:34:14, skipping insertion in model container [2018-12-09 10:34:14,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:34:14,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:34:13" (2/3) ... [2018-12-09 10:34:14,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea366af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:34:14, skipping insertion in model container [2018-12-09 10:34:14,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:34:14,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:34:14" (3/3) ... [2018-12-09 10:34:14,103 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2018-12-09 10:34:14,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:34:14,137 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:34:14,137 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:34:14,137 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:34:14,137 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:34:14,137 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:34:14,137 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:34:14,137 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:34:14,137 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:34:14,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 10:34:14,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 10:34:14,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:14,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:14,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:34:14,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:34:14,166 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:34:14,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 10:34:14,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 10:34:14,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:14,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:14,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:34:14,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:34:14,174 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2018-12-09 10:34:14,175 INFO L796 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2018-12-09 10:34:14,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-09 10:34:14,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-12-09 10:34:14,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-12-09 10:34:14,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,424 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:34:14,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:34:14,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:34:14,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:34:14,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:34:14,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:34:14,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:34:14,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:34:14,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 10:34:14,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:34:14,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:34:14,444 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-09 10:34:14,449 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-09 10:34:14,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-09 10:34:14,543 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-09 10:34:14,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-09 10:34:14,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:14,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:14,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:14,552 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-09 10:34:14,557 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-09 10:34:14,558 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-09 10:34:14,560 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-09 10:34:14,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:34:14,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:34:14,692 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-09 10:34:14,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:14,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:14,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:14,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:14,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:14,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:14,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:14,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:14,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:34:14,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:14,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:14,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:14,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:14,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:34:14,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:34:14,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:14,714 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-09 10:34:14,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:14,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:14,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:14,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:14,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:34:14,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:34:14,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:34:14,791 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:34:14,791 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 10:34:14,793 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:34:14,794 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:34:14,795 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:34:14,795 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-12-09 10:34:14,814 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 10:34:14,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 10:34:14,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:14,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:14,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:14,870 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-09 10:34:14,882 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-09 10:34:14,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2018-12-09 10:34:14,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2018-12-09 10:34:14,921 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-09 10:34:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:34:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-12-09 10:34:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 10:34:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-09 10:34:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 10:34:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:14,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2018-12-09 10:34:14,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 10:34:14,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2018-12-09 10:34:14,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 10:34:14,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 10:34:14,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-09 10:34:14,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:34:14,931 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 10:34:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-09 10:34:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-09 10:34:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 10:34:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-09 10:34:14,947 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 10:34:14,947 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 10:34:14,947 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:34:14,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-09 10:34:14,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 10:34:14,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:14,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:14,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:34:14,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:34:14,948 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 120#L367 assume !(main_~length~0 < 1); 126#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2018-12-09 10:34:14,948 INFO L796 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2018-12-09 10:34:14,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-12-09 10:34:14,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2018-12-09 10:34:14,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2018-12-09 10:34:14,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,083 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:34:15,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:34:15,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:34:15,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:34:15,084 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:34:15,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:34:15,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:34:15,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:34:15,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-09 10:34:15,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:34:15,085 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:34:15,087 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-09 10:34:15,089 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-09 10:34:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:15,173 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-09 10:34:15,175 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-09 10:34:15,176 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-09 10:34:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:15,178 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-09 10:34:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:15,180 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-09 10:34:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:15,288 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:34:15,288 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:34:15,289 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-09 10:34:15,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:15,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:15,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:15,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:15,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:15,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:15,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:15,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:15,290 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-09 10:34:15,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:15,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:15,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:15,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:15,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:15,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:15,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:15,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:15,291 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-09 10:34:15,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:15,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:15,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:15,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:15,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:34:15,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:34:15,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:34:15,314 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:34:15,314 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 10:34:15,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:34:15,316 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:34:15,316 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:34:15,316 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-09 10:34:15,320 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 10:34:15,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 10:34:15,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:15,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:15,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:15,348 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-09 10:34:15,348 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-09 10:34:15,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 10:34:15,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 19 states and 25 transitions. Complement of second has 6 states. [2018-12-09 10:34:15,362 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-09 10:34:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:34:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 10:34:15,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-09 10:34:15,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:15,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:34:15,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:15,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-09 10:34:15,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:15,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-12-09 10:34:15,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2018-12-09 10:34:15,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 10:34:15,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 10:34:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-12-09 10:34:15,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:34:15,366 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-09 10:34:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-12-09 10:34:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-09 10:34:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 10:34:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-09 10:34:15,367 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 10:34:15,367 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 10:34:15,367 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:34:15,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-12-09 10:34:15,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:15,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:15,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:34:15,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:34:15,369 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 226#L367 assume !(main_~length~0 < 1); 229#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 231#L371-3 assume !(main_~i~0 < main_~length~0); 234#L371-4 main_~j~0 := 0; 227#L374-3 assume !!(main_~j~0 < main_~length~0); 219#L375-3 [2018-12-09 10:34:15,369 INFO L796 eck$LassoCheckResult]: Loop: 219#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 220#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 219#L375-3 [2018-12-09 10:34:15,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2018-12-09 10:34:15,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2018-12-09 10:34:15,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2018-12-09 10:34:15,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:15,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:15,515 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-09 10:34:15,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:34:15,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:34:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:34:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:34:15,536 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-09 10:34:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:34:15,572 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-09 10:34:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:34:15,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-09 10:34:15,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2018-12-09 10:34:15,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 10:34:15,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 10:34:15,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-09 10:34:15,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:34:15,575 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-09 10:34:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-09 10:34:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-09 10:34:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 10:34:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-12-09 10:34:15,577 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-09 10:34:15,577 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-09 10:34:15,577 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:34:15,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-12-09 10:34:15,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:15,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:15,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:34:15,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:34:15,578 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 282#L367 assume !(main_~length~0 < 1); 286#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 287#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 288#L371-3 assume !(main_~i~0 < main_~length~0); 292#L371-4 main_~j~0 := 0; 283#L374-3 assume !!(main_~j~0 < main_~length~0); 284#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 291#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 279#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 280#L374-3 assume !!(main_~j~0 < main_~length~0); 275#L375-3 [2018-12-09 10:34:15,578 INFO L796 eck$LassoCheckResult]: Loop: 275#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 276#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 275#L375-3 [2018-12-09 10:34:15,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2018-12-09 10:34:15,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:34:15,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:34:15,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_de6c262d-02e4-4e46-8ff3-0725b870709d/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-09 10:34:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:34:15,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:34:15,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:34:15,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:34:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 10:34:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-12-09 10:34:15,691 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:34:15,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2018-12-09 10:34:15,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:34:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:34:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:34:15,713 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-12-09 10:34:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:34:15,775 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-09 10:34:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:34:15,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-12-09 10:34:15,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 22 transitions. [2018-12-09 10:34:15,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 10:34:15,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 10:34:15,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-09 10:34:15,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:34:15,777 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 10:34:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-09 10:34:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-09 10:34:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 10:34:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-09 10:34:15,778 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 10:34:15,778 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 10:34:15,778 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:34:15,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-09 10:34:15,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 10:34:15,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:34:15,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:34:15,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:34:15,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 10:34:15,780 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 381#L367 assume !(main_~length~0 < 1); 385#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 386#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 389#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 387#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 388#L371-3 assume !(main_~i~0 < main_~length~0); 391#L371-4 main_~j~0 := 0; 382#L374-3 assume !!(main_~j~0 < main_~length~0); 383#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 390#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 378#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 379#L374-3 assume !!(main_~j~0 < main_~length~0); 374#L375-3 [2018-12-09 10:34:15,780 INFO L796 eck$LassoCheckResult]: Loop: 374#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 375#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 374#L375-3 [2018-12-09 10:34:15,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2018-12-09 10:34:15,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:34:15,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2018-12-09 10:34:15,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:34:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2018-12-09 10:34:15,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:34:15,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:34:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:34:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:34:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:34:15,945 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2018-12-09 10:34:15,978 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:34:15,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:34:15,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:34:15,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:34:15,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:34:15,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:34:15,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:34:15,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:34:15,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-09 10:34:15,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:34:15,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:34:15,981 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-09 10:34:15,982 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-09 10:34:15,983 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-09 10:34:15,984 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-09 10:34:15,985 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-09 10:34:15,986 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-09 10:34:15,987 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-09 10:34:15,988 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-09 10:34:16,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:16,037 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-09 10:34:16,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:34:16,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:34:16,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:34:16,140 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-09 10:34:16,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,142 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-09 10:34:16,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,144 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-09 10:34:16,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:34:16,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:34:16,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,146 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-09 10:34:16,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,148 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-09 10:34:16,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,150 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-09 10:34:16,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,151 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-09 10:34:16,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,152 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-09 10:34:16,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:34:16,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:34:16,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:34:16,155 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-09 10:34:16,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:34:16,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:34:16,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:34:16,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:34:16,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:34:16,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:34:16,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:34:16,157 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:34:16,158 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:34:16,158 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:34:16,158 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:34:16,158 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:34:16,158 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:34:16,159 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))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-12-09 10:34:16,164 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 10:34:16,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:34:16,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,192 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-09 10:34:16,193 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-09 10:34:16,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 10:34:16,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-12-09 10:34:16,200 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-09 10:34:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:34:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 10:34:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 10:34:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:16,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:34:16,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,225 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-09 10:34:16,225 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-09 10:34:16,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 10:34:16,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-12-09 10:34:16,232 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-09 10:34:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:34:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 10:34:16,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 10:34:16,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:16,233 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:34:16,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:34:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:34:16,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:34:16,261 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-09 10:34:16,261 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-09 10:34:16,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 10:34:16,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2018-12-09 10:34:16,270 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-09 10:34:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:34:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 10:34:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 10:34:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-09 10:34:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-09 10:34:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:34:16,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-12-09 10:34:16,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:34:16,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:34:16,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:34:16,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:34:16,272 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:34:16,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:34:16,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:34:16,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:34:16,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:34:16 BoogieIcfgContainer [2018-12-09 10:34:16,276 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:34:16,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:34:16,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:34:16,276 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:34:16,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:34:14" (3/4) ... [2018-12-09 10:34:16,279 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:34:16,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:34:16,279 INFO L168 Benchmark]: Toolchain (without parser) took 2663.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 957.1 MB in the beginning and 1.0 GB in the end (delta: -50.2 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:34:16,280 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:34:16,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:34:16,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.02 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-09 10:34:16,281 INFO L168 Benchmark]: Boogie Preprocessor took 14.51 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-09 10:34:16,281 INFO L168 Benchmark]: RCFGBuilder took 141.60 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:34:16,281 INFO L168 Benchmark]: BuchiAutomizer took 2178.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 145.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:34:16,282 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:34:16,284 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.02 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. * Boogie Preprocessor took 14.51 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 141.60 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2178.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 145.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * j and consists of 4 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 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 123 SDslu, 53 SDs, 0 SdLazy, 132 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf99 lsp95 ukn75 mio100 lsp61 div100 bol100 ite100 ukn100 eq154 hnf91 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...