./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 79c8f3e75568b724086e7997d923ad8ab07e6657 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:33,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:33,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:33,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:33,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:33,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:33,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:33,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:33,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:33,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:33,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:33,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:33,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:33,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:33,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:33,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:33,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:33,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:33,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:33,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:33,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:33,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:33,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:33,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:33,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:33,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:33,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:33,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:33,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:33,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:33,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:33,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:33,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:33,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:33,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:33,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:33,255 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:33,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:33,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:33,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:33,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:33,270 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:33,270 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:33,270 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:33,271 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:33,271 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:33,271 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:33,271 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:33,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:33,272 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:33,273 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:33,274 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:33,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:33,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:33,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:33,274 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:33,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:33,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:33,275 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:33,277 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:33,277 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79c8f3e75568b724086e7997d923ad8ab07e6657 [2018-10-27 06:06:33,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:33,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:33,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:33,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:33,322 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:33,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2018-10-27 06:06:33,381 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/data/7369c4bb3/75e585a6ad84448e99a6f81b2069e14d/FLAG70c3ce429 [2018-10-27 06:06:33,824 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:33,825 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/sv-benchmarks/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2018-10-27 06:06:33,836 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/data/7369c4bb3/75e585a6ad84448e99a6f81b2069e14d/FLAG70c3ce429 [2018-10-27 06:06:33,850 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/data/7369c4bb3/75e585a6ad84448e99a6f81b2069e14d [2018-10-27 06:06:33,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:33,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:33,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:33,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:33,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:33,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:33" (1/1) ... [2018-10-27 06:06:33,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:33, skipping insertion in model container [2018-10-27 06:06:33,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:33" (1/1) ... [2018-10-27 06:06:33,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:33,904 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:34,211 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:34,220 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:34,255 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:34,319 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:34,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34 WrapperNode [2018-10-27 06:06:34,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:34,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:34,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:34,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:34,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:34,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:34,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:34,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:34,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... [2018-10-27 06:06:34,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:34,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:34,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:34,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:34,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_732dd181-7706-4afc-9505-938b34f8bc7d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:34,900 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:34,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:34 BoogieIcfgContainer [2018-10-27 06:06:34,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:34,902 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:34,902 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:34,905 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:34,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:34,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:33" (1/3) ... [2018-10-27 06:06:34,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c228bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:34, skipping insertion in model container [2018-10-27 06:06:34,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:34,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:34" (2/3) ... [2018-10-27 06:06:34,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c228bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:34, skipping insertion in model container [2018-10-27 06:06:34,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:34,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:34" (3/3) ... [2018-10-27 06:06:34,909 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_reverse_alloca_true-termination.c.i [2018-10-27 06:06:34,959 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:34,959 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:34,960 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:34,960 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:34,960 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:34,960 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:34,960 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:34,960 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:34,960 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:34,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:06:35,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:06:35,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:35,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:35,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:35,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:06:35,008 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:35,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:06:35,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:06:35,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:35,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:35,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:35,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:06:35,021 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 4#L377true assume !(main_~length1~0 < 1); 8#L377-2true assume !(main_~length2~0 < 2); 20#L380-1true assume !(main_~length3~0 < 1); 14#L383-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 23#L389true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L389 3#L389-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - main_~length3~0) * 1, 1); srcloc: L389-1 19#L390true main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 10#L367-4true [2018-10-27 06:06:35,024 INFO L795 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 5#L367-1true SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 7#L367-2true assume !!(cstrcat_#t~mem205 != 0);havoc cstrcat_#t~mem205;cstrcat_#t~post206.base, cstrcat_#t~post206.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post206.base, cstrcat_#t~post206.offset - 1;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset; 10#L367-4true [2018-10-27 06:06:35,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-10-27 06:06:35,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-10-27 06:06:35,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-10-27 06:06:35,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:36,100 WARN L179 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-10-27 06:06:36,534 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:06:36,544 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:36,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:36,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:36,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:36,546 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:36,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:36,547 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:36,547 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:36,548 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:36,548 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:36,548 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:36,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:36,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:36,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:36,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:36,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,046 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-10-27 06:06:37,207 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-10-27 06:06:37,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,793 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:37,798 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:37,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:37,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:37,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:37,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:37,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:37,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:37,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:37,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:37,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:37,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:37,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:37,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:37,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:37,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:37,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:37,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:37,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:37,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:37,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:37,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:37,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:37,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,018 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:38,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:38,034 INFO L444 ModelExtractionUtils]: 61 out of 64 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:06:38,037 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:38,038 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:38,038 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:38,039 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0.offset) = 2*ULTIMATE.start_cstrcat_~s~0.offset + 1 Supporting invariants [] [2018-10-27 06:06:38,147 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-10-27 06:06:38,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:38,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:06:38,326 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-10-27 06:06:38,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 54 states and 65 transitions. Complement of second has 7 states. [2018-10-27 06:06:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:06:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-10-27 06:06:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-10-27 06:06:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-10-27 06:06:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:06:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:38,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-10-27 06:06:38,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:06:38,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-10-27 06:06:38,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-10-27 06:06:38,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:06:38,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-10-27 06:06:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:38,409 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:06:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-10-27 06:06:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-10-27 06:06:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:06:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-10-27 06:06:38,429 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-10-27 06:06:38,429 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-10-27 06:06:38,429 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:38,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-10-27 06:06:38,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:06:38,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:38,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:38,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:38,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:38,431 INFO L793 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 189#L377 assume !(main_~length1~0 < 1); 190#L377-2 assume !(main_~length2~0 < 2); 196#L380-1 assume !(main_~length3~0 < 1); 200#L383-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 201#L389 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L389 187#L389-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - main_~length3~0) * 1, 1); srcloc: L389-1 188#L390 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 198#L367-4 assume true; 193#L367-1 SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 194#L367-2 assume !(cstrcat_#t~mem205 != 0);havoc cstrcat_#t~mem205; 192#L369-5 [2018-10-27 06:06:38,431 INFO L795 eck$LassoCheckResult]: Loop: 192#L369-5 assume true; 197#L369 cstrcat_#t~post207.base, cstrcat_#t~post207.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post207.base, cstrcat_#t~post207.offset - 1;cstrcat_#t~post208.base, cstrcat_#t~post208.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post208.base, cstrcat_#t~post208.offset - 1; 203#L369-1 SUMMARY for call cstrcat_#t~mem209 := read~int(cstrcat_#t~post208.base, cstrcat_#t~post208.offset, 1); srcloc: L369-1 204#L369-2 SUMMARY for call write~int(cstrcat_#t~mem209, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, 1); srcloc: L369-2 191#L369-3 assume !!(cstrcat_#t~mem209 != 0);havoc cstrcat_#t~mem209;havoc cstrcat_#t~post207.base, cstrcat_#t~post207.offset;havoc cstrcat_#t~post208.base, cstrcat_#t~post208.offset; 192#L369-5 [2018-10-27 06:06:38,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-10-27 06:06:38,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-10-27 06:06:38,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:38,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:38,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-10-27 06:06:38,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:38,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,092 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2018-10-27 06:06:39,186 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:39,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:39,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:39,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:39,186 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:39,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:39,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:39,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:39,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:06:39,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:39,187 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:39,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,602 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-10-27 06:06:39,738 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-10-27 06:06:39,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:40,401 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:40,401 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:40,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,476 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:40,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,478 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:40,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:40,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:40,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,564 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:40,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:40,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,566 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,632 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:40,689 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:06:40,695 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:06:40,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:40,696 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:40,697 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:40,697 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 + 2*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-10-27 06:06:41,116 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2018-10-27 06:06:41,126 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:41,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:41,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:41,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:41,415 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-10-27 06:06:41,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-10-27 06:06:41,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 24 states and 29 transitions. Complement of second has 10 states. [2018-10-27 06:06:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-10-27 06:06:41,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:06:41,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:41,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:06:41,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:41,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:06:41,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:41,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-10-27 06:06:41,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:41,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-10-27 06:06:41,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:41,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:41,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:41,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:41,606 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:41,606 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:41,606 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:41,606 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:41,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:41,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:41,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:41,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:41 BoogieIcfgContainer [2018-10-27 06:06:41,611 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:41,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:41,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:41,612 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:41,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:34" (3/4) ... [2018-10-27 06:06:41,616 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:41,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:41,617 INFO L168 Benchmark]: Toolchain (without parser) took 7763.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 148.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,618 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:41,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 930.2 MB in the beginning and 1.2 GB in the end (delta: -229.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,619 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,620 INFO L168 Benchmark]: RCFGBuilder took 437.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,620 INFO L168 Benchmark]: BuchiAutomizer took 6710.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:41,621 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:41,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 930.2 MB in the beginning and 1.2 GB in the end (delta: -229.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 437.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6710.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + 2 * s and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 53 SDslu, 40 SDs, 0 SdLazy, 20 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf99 lsp97 ukn107 mio100 lsp49 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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...