./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/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 32bit --witnessprinter.graph.data.programhash c8e64c1324249ca9b9e3c019cfc2046542af7b26 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:37,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:37,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:37,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:37,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:37,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:37,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:37,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:37,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:37,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:38,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:38,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:38,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:38,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:38,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:38,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:38,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:38,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:38,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:38,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:38,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:38,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:38,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:38,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:38,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:38,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:38,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:38,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:38,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:38,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:38,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:38,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:38,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:38,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:38,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:38,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:38,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:38,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:38,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:38,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:38,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:38,033 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:38,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:38,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:38,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:38,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:38,061 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:38,061 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:38,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:38,062 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:38,062 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:38,062 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:38,062 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:38,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:38,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:38,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:38,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:38,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:38,065 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:38,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:38,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:38,065 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:38,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:38,066 INFO L138 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_578330a7-e120-43de-b54c-d5f0166b95c2/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8e64c1324249ca9b9e3c019cfc2046542af7b26 [2019-10-22 08:59:38,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:38,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:38,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:38,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:38,116 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:38,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-10-22 08:59:38,166 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/data/550ef8d4d/e90964aa119d4ec0bc96f7066e600948/FLAG28f3adeca [2019-10-22 08:59:38,650 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:38,651 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-10-22 08:59:38,661 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/data/550ef8d4d/e90964aa119d4ec0bc96f7066e600948/FLAG28f3adeca [2019-10-22 08:59:39,136 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/data/550ef8d4d/e90964aa119d4ec0bc96f7066e600948 [2019-10-22 08:59:39,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:39,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:39,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:39,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:39,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:39,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb5fa4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39, skipping insertion in model container [2019-10-22 08:59:39,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,158 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:39,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:39,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:39,539 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:39,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:39,652 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:39,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39 WrapperNode [2019-10-22 08:59:39,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:39,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:39,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:39,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:39,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:39,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:39,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:39,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:39,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... [2019-10-22 08:59:39,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:39,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:39,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:39,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:39,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/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 [2019-10-22 08:59:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:39,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:40,066 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:40,067 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:59:40,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:40 BoogieIcfgContainer [2019-10-22 08:59:40,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:40,068 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:40,068 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:40,072 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:40,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:40,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:39" (1/3) ... [2019-10-22 08:59:40,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@466984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:40, skipping insertion in model container [2019-10-22 08:59:40,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:40,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:39" (2/3) ... [2019-10-22 08:59:40,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@466984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:40, skipping insertion in model container [2019-10-22 08:59:40,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:40,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:40" (3/3) ... [2019-10-22 08:59:40,076 INFO L371 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2019-10-22 08:59:40,109 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:40,110 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:40,110 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:40,110 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:40,110 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:40,110 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:40,110 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:40,110 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:40,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:59:40,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:40,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:40,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:40,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:40,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:40,147 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:40,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:59:40,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:40,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:40,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:40,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:40,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:40,156 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L515true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 5#L515-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 14#L517true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 15#L520-3true [2019-10-22 08:59:40,156 INFO L793 eck$LassoCheckResult]: Loop: 15#L520-3true assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 12#L520-2true main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L520-3true [2019-10-22 08:59:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:59:40,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54611029] [2019-10-22 08:59:40,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,279 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-10-22 08:59:40,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792981066] [2019-10-22 08:59:40,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-10-22 08:59:40,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519806750] [2019-10-22 08:59:40,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:40,517 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:40,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:40,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:40,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:40,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:40,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:40,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:40,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:40,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2019-10-22 08:59:40,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:40,520 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:40,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:40,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:41,041 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:41,046 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:41,048 INFO L120 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 [2019-10-22 08:59:41,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,056 INFO L120 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 [2019-10-22 08:59:41,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,059 INFO L120 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 [2019-10-22 08:59:41,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,062 INFO L120 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 [2019-10-22 08:59:41,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,066 INFO L120 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 [2019-10-22 08:59:41,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,069 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:41,069 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:41,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,073 INFO L120 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 [2019-10-22 08:59:41,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,076 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:41,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:41,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,080 INFO L120 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 [2019-10-22 08:59:41,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,083 INFO L120 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 [2019-10-22 08:59:41,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:41,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:41,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,098 INFO L120 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 [2019-10-22 08:59:41,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:41,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:41,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:41,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,109 INFO L120 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 [2019-10-22 08:59:41,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:41,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:41,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:41,130 INFO L120 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 [2019-10-22 08:59:41,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:41,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:41,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:41,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:41,141 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:41,141 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:41,225 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:41,318 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:41,319 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:41,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:41,323 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:41,323 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:41,324 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:59:41,337 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:41,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:41,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:41,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:41,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:41,423 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 [2019-10-22 08:59:41,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-10-22 08:59:41,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 31 states and 41 transitions. Complement of second has 7 states. [2019-10-22 08:59:41,471 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 [2019-10-22 08:59:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-10-22 08:59:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:41,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:41,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:59:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:41,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2019-10-22 08:59:41,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:41,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2019-10-22 08:59:41,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:41,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:41,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:59:41,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:41,490 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:59:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:59:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:59:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:59:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:59:41,519 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:59:41,519 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:59:41,519 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:41,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:59:41,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:41,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:41,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:41,520 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:41,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:41,521 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 105#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 106#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 110#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 113#L520-3 assume !(main_~k~0 < main_~length~0); 109#L525-2 [2019-10-22 08:59:41,521 INFO L793 eck$LassoCheckResult]: Loop: 109#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 108#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 109#L525-2 [2019-10-22 08:59:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2019-10-22 08:59:41,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:41,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74571249] [2019-10-22 08:59:41,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:41,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74571249] [2019-10-22 08:59:41,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:41,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:41,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952932511] [2019-10-22 08:59:41,576 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2019-10-22 08:59:41,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:41,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818937681] [2019-10-22 08:59:41,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,589 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:41,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:41,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:41,666 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:59:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:41,692 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-10-22 08:59:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:41,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-10-22 08:59:41,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:41,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 08:59:41,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:41,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:41,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-10-22 08:59:41,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:41,694 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:59:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-10-22 08:59:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:59:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:59:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-10-22 08:59:41,696 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:59:41,696 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:59:41,697 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:41,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-10-22 08:59:41,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:41,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:41,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:41,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:41,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:41,698 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 135#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 138#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 141#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 139#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 140#L520-3 assume !(main_~k~0 < main_~length~0); 137#L525-2 [2019-10-22 08:59:41,698 INFO L793 eck$LassoCheckResult]: Loop: 137#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 136#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 137#L525-2 [2019-10-22 08:59:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2019-10-22 08:59:41,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:41,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283221380] [2019-10-22 08:59:41,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2019-10-22 08:59:41,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:41,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896419159] [2019-10-22 08:59:41,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:41,735 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2019-10-22 08:59:41,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:41,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489918149] [2019-10-22 08:59:41,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:41,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:42,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489918149] [2019-10-22 08:59:42,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826185295] [2019-10-22 08:59:42,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_578330a7-e120-43de-b54c-d5f0166b95c2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:42,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:59:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:42,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-22 08:59:42,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:42,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:42,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:42,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-10-22 08:59:42,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:42,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-10-22 08:59:42,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 08:59:42,290 INFO L567 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size [2019-10-22 08:59:42,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:42,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-22 08:59:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:42,300 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:42,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-22 08:59:42,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652759575] [2019-10-22 08:59:42,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:59:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:59:42,369 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-10-22 08:59:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:42,576 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 08:59:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:42,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:59:42,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:42,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2019-10-22 08:59:42,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:42,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:42,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-10-22 08:59:42,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:42,579 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:59:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-10-22 08:59:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 08:59:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:59:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-10-22 08:59:42,580 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:59:42,580 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:59:42,580 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:42,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-10-22 08:59:42,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:42,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:42,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:42,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:42,582 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:42,582 INFO L791 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 210#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 212#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 215#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 218#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 216#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 217#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 219#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 220#L520-3 assume !(main_~k~0 < main_~length~0); 214#L525-2 [2019-10-22 08:59:42,582 INFO L793 eck$LassoCheckResult]: Loop: 214#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 213#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem6;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 214#L525-2 [2019-10-22 08:59:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2019-10-22 08:59:42,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635911738] [2019-10-22 08:59:42,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,610 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2019-10-22 08:59:42,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554051827] [2019-10-22 08:59:42,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,627 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2019-10-22 08:59:42,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455963122] [2019-10-22 08:59:42,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:42,858 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-10-22 08:59:42,897 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:42,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:42,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:42,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:42,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:42,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:42,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:42,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:42,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2019-10-22 08:59:42,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:42,898 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:42,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:42,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:42,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:42,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:43,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:43,350 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:43,350 INFO L120 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 [2019-10-22 08:59:43,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:43,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:43,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:43,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:43,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:43,352 INFO L120 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 [2019-10-22 08:59:43,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:43,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:43,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:43,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:43,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:43,354 INFO L120 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 [2019-10-22 08:59:43,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:43,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,356 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:43,356 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:43,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:43,359 INFO L120 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 [2019-10-22 08:59:43,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:43,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:43,361 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:43,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:43,369 INFO L120 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 [2019-10-22 08:59:43,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,370 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:43,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,372 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:43,372 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:43,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:43,380 INFO L120 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 [2019-10-22 08:59:43,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:43,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:43,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:43,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:43,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:43,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:43,403 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:43,423 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:43,423 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:43,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:43,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:43,425 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:43,425 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1) = -1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 Supporting invariants [] [2019-10-22 08:59:43,445 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:43,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:43,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:43,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,488 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 [2019-10-22 08:59:43,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:59:43,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 4 states. [2019-10-22 08:59:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-10-22 08:59:43,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:59:43,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:43,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:59:43,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:43,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:43,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:43,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 08:59:43,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:43,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-10-22 08:59:43,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:43,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:43,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:43,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:43,499 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:43,500 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:43,500 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:43,500 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:43,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:43,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:43,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:43,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:43 BoogieIcfgContainer [2019-10-22 08:59:43,506 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:43,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:43,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:43,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:43,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:40" (3/4) ... [2019-10-22 08:59:43,509 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:43,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:43,510 INFO L168 Benchmark]: Toolchain (without parser) took 4370.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 943.2 MB in the beginning and 998.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:43,511 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:43,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:43,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:43,512 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:43,512 INFO L168 Benchmark]: RCFGBuilder took 334.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:43,513 INFO L168 Benchmark]: BuchiAutomizer took 3437.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 92.3 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:43,513 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 998.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:43,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 512.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 334.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3437.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 92.3 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 998.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * k + length and consists of 5 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 56 SDslu, 14 SDs, 0 SdLazy, 82 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax113 hnf98 lsp84 ukn80 mio100 lsp60 div100 bol100 ite100 ukn100 eq170 hnf91 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...