./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcat_mixed_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_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcat_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/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 da8216583f63c00b6a47f47712e26111f4383b57 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:02:33,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:02:33,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:02:33,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:02:33,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:02:33,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:02:33,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:02:33,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:02:33,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:02:33,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:02:33,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:02:33,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:02:33,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:02:33,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:02:33,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:02:33,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:02:33,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:02:33,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:02:33,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:02:33,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:02:33,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:02:33,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:02:33,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:02:33,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:02:33,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:02:33,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:02:33,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:02:33,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:02:33,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:02:33,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:02:33,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:02:33,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:02:33,355 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:02:33,355 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:02:33,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:02:33,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:02:33,356 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:02:33,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:02:33,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:02:33,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:02:33,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:02:33,368 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:02:33,368 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:02:33,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:02:33,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:02:33,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:02:33,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:02:33,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:02:33,371 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:02:33,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:02:33,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:02:33,371 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:02:33,372 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:02:33,372 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_3496d044-c770-4116-ad2b-ae564e3292f9/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 -> da8216583f63c00b6a47f47712e26111f4383b57 [2018-11-10 13:02:33,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:02:33,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:02:33,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:02:33,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:02:33,405 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:02:33,406 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcat_mixed_alloca_true-termination.c.i [2018-11-10 13:02:33,443 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/data/4cd1cc0a0/3254eb1a31cf4e34875a5e4fb72a5019/FLAGcb559eed4 [2018-11-10 13:02:33,880 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:02:33,881 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/sv-benchmarks/c/termination-15/cstrcat_mixed_alloca_true-termination.c.i [2018-11-10 13:02:33,887 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/data/4cd1cc0a0/3254eb1a31cf4e34875a5e4fb72a5019/FLAGcb559eed4 [2018-11-10 13:02:33,895 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/data/4cd1cc0a0/3254eb1a31cf4e34875a5e4fb72a5019 [2018-11-10 13:02:33,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:02:33,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:02:33,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:33,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:02:33,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:02:33,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:33" (1/1) ... [2018-11-10 13:02:33,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4943cf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:33, skipping insertion in model container [2018-11-10 13:02:33,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:33" (1/1) ... [2018-11-10 13:02:33,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:02:33,942 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:02:34,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:34,153 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:02:34,184 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:34,227 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:02:34,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34 WrapperNode [2018-11-10 13:02:34,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:34,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:34,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:02:34,228 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:02:34,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:34,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:02:34,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:02:34,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:02:34,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... [2018-11-10 13:02:34,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:02:34,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:02:34,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:02:34,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:02:34,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3496d044-c770-4116-ad2b-ae564e3292f9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:02:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:02:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:02:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:02:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:02:34,544 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:02:34,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:34 BoogieIcfgContainer [2018-11-10 13:02:34,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:02:34,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:02:34,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:02:34,549 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:02:34,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:34,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:02:33" (1/3) ... [2018-11-10 13:02:34,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25c64f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:34, skipping insertion in model container [2018-11-10 13:02:34,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:34,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:34" (2/3) ... [2018-11-10 13:02:34,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25c64f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:34, skipping insertion in model container [2018-11-10 13:02:34,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:34,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:34" (3/3) ... [2018-11-10 13:02:34,553 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_mixed_alloca_true-termination.c.i [2018-11-10 13:02:34,596 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:02:34,597 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:02:34,597 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:02:34,597 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:02:34,597 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:02:34,597 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:02:34,597 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:02:34,598 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:02:34,598 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:02:34,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 13:02:34,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 13:02:34,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:34,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:34,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:02:34,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:02:34,629 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:02:34,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 13:02:34,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 13:02:34,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:34,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:34,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:02:34,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:02:34,638 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#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_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L389 3#L389-1true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 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;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-11-10 13:02:34,638 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-11-10 13:02:34,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 13:02:34,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 13:02:34,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 13:02:34,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:34,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:35,167 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 13:02:35,260 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:02:35,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:02:35,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:02:35,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:02:35,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:02:35,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:02:35,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:02:35,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:02:35,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 13:02:35,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:02:35,262 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:02:35,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,527 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-11-10 13:02:35,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,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-11-10 13:02:35,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:35,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,008 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:02:36,011 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:02:36,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:36,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:36,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:36,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:36,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:36,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:36,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:36,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:36,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:36,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:36,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,063 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:02:36,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:02:36,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:36,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,088 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:02:36,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:02:36,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:36,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:36,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:36,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:36,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:36,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:36,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:36,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:36,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:02:36,183 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:02:36,183 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:02:36,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:02:36,186 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:02:36,186 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:02:36,187 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 13:02:36,224 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 13:02:36,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 13:02:36,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:36,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:36,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:36,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 13:02:36,300 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 13:02:36,355 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-11-10 13:02:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:02:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:02:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-10 13:02:36,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 13:02:36,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:36,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 13:02:36,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:36,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 13:02:36,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:36,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-10 13:02:36,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 13:02:36,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-11-10 13:02:36,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 13:02:36,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:02:36,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 13:02:36,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:36,369 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 13:02:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 13:02:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-10 13:02:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 13:02:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-10 13:02:36,392 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 13:02:36,392 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 13:02:36,393 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:02:36,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-10 13:02:36,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 13:02:36,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:36,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:36,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:02:36,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:02:36,395 INFO L793 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#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; 185#L377 assume !(main_~length1~0 < 1); 186#L377-2 assume !(main_~length2~0 < 2); 192#L380-1 assume !(main_~length3~0 < 1); 196#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; 197#L389 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L389 183#L389-1 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L389-1 184#L390 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~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; 194#L367-4 assume true; 189#L367-1 SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 190#L367-2 assume !(cstrcat_#t~mem205 != 0);havoc cstrcat_#t~mem205; 188#L369-5 [2018-11-10 13:02:36,395 INFO L795 eck$LassoCheckResult]: Loop: 188#L369-5 assume true; 193#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; 199#L369-1 SUMMARY for call cstrcat_#t~mem209 := read~int(cstrcat_#t~post208.base, cstrcat_#t~post208.offset, 1); srcloc: L369-1 200#L369-2 SUMMARY for call write~int(cstrcat_#t~mem209, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, 1); srcloc: L369-2 187#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; 188#L369-5 [2018-11-10 13:02:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-11-10 13:02:36,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-11-10 13:02:36,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:36,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-11-10 13:02:36,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:36,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:36,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:36,712 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2018-11-10 13:02:36,789 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:02:36,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:02:36,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:02:36,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:02:36,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:02:36,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:02:36,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:02:36,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:02:36,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 13:02:36,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:02:36,790 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:02:36,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:36,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,087 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-10 13:02:37,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,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-11-10 13:02:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,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-11-10 13:02:37,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-11-10 13:02:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:02:37,626 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:02:37,627 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:02:37,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:37,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:37,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:37,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,655 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:02:37,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:02:37,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:37,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:02:37,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:37,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:37,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:37,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:37,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:37,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:37,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:02:37,741 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 13:02:37,741 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 13:02:37,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:02:37,743 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:02:37,743 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:02:37,743 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s2.offset) = 2*ULTIMATE.start_cstrcat_~s2.offset + 1 Supporting invariants [] [2018-11-10 13:02:37,798 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 13:02:37,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:37,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:37,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:37,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 13:02:37,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 13:02:37,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 24 states and 29 transitions. Complement of second has 6 states. [2018-11-10 13:02:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:02:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 13:02:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 13:02:37,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 13:02:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 13:02:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 13:02:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:37,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-10 13:02:37,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:02:37,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 13:02:37,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:02:37,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:02:37,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:02:37,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:37,925 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:37,925 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:37,925 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:37,925 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:02:37,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:02:37,925 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:02:37,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:02:37,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:02:37 BoogieIcfgContainer [2018-11-10 13:02:37,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:02:37,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:02:37,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:02:37,935 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:02:37,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:34" (3/4) ... [2018-11-10 13:02:37,938 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:02:37,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:02:37,939 INFO L168 Benchmark]: Toolchain (without parser) took 4041.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -248.9 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:37,940 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:37,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.96 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:37,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:37,941 INFO L168 Benchmark]: Boogie Preprocessor took 16.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:37,941 INFO L168 Benchmark]: RCFGBuilder took 223.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:37,942 INFO L168 Benchmark]: BuchiAutomizer took 3389.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:37,942 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:37,945 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.96 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 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 76.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 223.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3389.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 unknown-#length-unknown[s] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function 2 * s2 + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 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: 43 SDtfs, 47 SDslu, 22 SDs, 0 SdLazy, 16 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf99 lsp97 ukn107 mio100 lsp42 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 6 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...