./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncat-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_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/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 0131b237d1353fa18fec727a7424c78c2056aaff .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:20,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:20,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:20,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:20,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:20,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:20,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:20,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:20,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:20,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:20,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:20,364 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:20,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:20,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:20,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:20,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:20,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:20,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:20,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:20,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:20,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:20,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:20,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:20,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:20,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:20,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:20,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:20,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:20,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:20,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:20,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:20,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:20,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:20,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:20,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:20,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:20,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:20,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:20,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:20,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:20,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:20,398 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:20,399 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:20,399 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:20,399 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:20,399 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:20,399 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:20,399 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:20,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:20,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:20,401 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:20,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:20,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:20,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:20,401 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:20,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:20,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:20,402 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:20,404 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:20,405 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_20930fbf-59fc-4747-a8b9-eb59e296cb70/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 -> 0131b237d1353fa18fec727a7424c78c2056aaff [2018-10-27 06:11:20,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:20,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:20,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:20,444 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:20,445 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:20,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca_true-termination.c.i [2018-10-27 06:11:20,489 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/data/171db4191/86669aad4cb043d0aec983f1e81a0cef/FLAG8cc1fcc94 [2018-10-27 06:11:20,895 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:20,895 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca_true-termination.c.i [2018-10-27 06:11:20,908 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/data/171db4191/86669aad4cb043d0aec983f1e81a0cef/FLAG8cc1fcc94 [2018-10-27 06:11:20,921 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/data/171db4191/86669aad4cb043d0aec983f1e81a0cef [2018-10-27 06:11:20,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:20,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:20,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:20,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:20,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:20,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:20" (1/1) ... [2018-10-27 06:11:20,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120bde97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:20, skipping insertion in model container [2018-10-27 06:11:20,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:20" (1/1) ... [2018-10-27 06:11:20,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:20,982 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:21,217 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:21,226 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:21,282 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:21,318 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:21,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21 WrapperNode [2018-10-27 06:11:21,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:21,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:21,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:21,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:21,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:21,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:21,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:21,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:21,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... [2018-10-27 06:11:21,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:21,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:21,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:21,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:21,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20930fbf-59fc-4747-a8b9-eb59e296cb70/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:21,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:22,055 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:22,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:22 BoogieIcfgContainer [2018-10-27 06:11:22,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:22,056 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:22,056 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:22,060 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:22,061 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:22,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:20" (1/3) ... [2018-10-27 06:11:22,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cf1cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:22, skipping insertion in model container [2018-10-27 06:11:22,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:22,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:21" (2/3) ... [2018-10-27 06:11:22,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cf1cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:22, skipping insertion in model container [2018-10-27 06:11:22,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:22,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:22" (3/3) ... [2018-10-27 06:11:22,064 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca_true-termination.c.i [2018-10-27 06:11:22,118 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:22,119 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:22,119 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:22,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:22,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:22,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:22,120 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:22,120 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:22,120 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:22,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:11:22,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:11:22,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:22,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:22,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:22,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:11:22,163 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:22,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:11:22,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:11:22,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:22,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:22,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:22,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:11:22,175 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 27#L564true assume !(main_~length1~0 < 1); 29#L564-2true assume !(main_~length2~0 < 1); 23#L567-1true assume !(main_~n~0 < 1); 5#L570-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 25#L576true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L576 26#L576-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L576-1 10#L577true assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L550-4true [2018-10-27 06:11:22,175 INFO L795 eck$LassoCheckResult]: Loop: 8#L550-4true assume true; 19#L550-1true SUMMARY for call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L550-1 3#L550-2true assume !!(cstrncat_#t~mem2 != 0);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, cstrncat_#t~post3.offset + 1;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 8#L550-4true [2018-10-27 06:11:22,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-10-27 06:11:22,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-10-27 06:11:22,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-10-27 06:11:22,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,516 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:11:23,389 WARN L179 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2018-10-27 06:11:23,579 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:11:23,607 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:23,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:23,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:23,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:23,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:23,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:23,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:23,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:23,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:11:23,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:23,612 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:23,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,024 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-10-27 06:11:24,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,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-10-27 06:11:24,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-10-27 06:11:24,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:24,779 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:24,784 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:24,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,817 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:24,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,820 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:24,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:24,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:24,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:11:24,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:11:24,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:24,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:25,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:25,092 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:25,094 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:25,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:25,098 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:25,099 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:25,100 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 Supporting invariants [] [2018-10-27 06:11:25,290 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:25,295 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:25,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:25,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:25,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:25,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:25,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2018-10-27 06:11:25,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 79 states and 101 transitions. Complement of second has 7 states. [2018-10-27 06:11:25,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-10-27 06:11:25,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 3 letters. [2018-10-27 06:11:25,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 12 letters. Loop has 3 letters. [2018-10-27 06:11:25,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:11:25,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 101 transitions. [2018-10-27 06:11:25,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:25,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 32 states and 39 transitions. [2018-10-27 06:11:25,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:25,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:11:25,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-10-27 06:11:25,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:25,503 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-10-27 06:11:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-10-27 06:11:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-10-27 06:11:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 06:11:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-10-27 06:11:25,530 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-10-27 06:11:25,531 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-10-27 06:11:25,531 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:25,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-10-27 06:11:25,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:25,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:25,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:25,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:11:25,533 INFO L793 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 224#L564 assume !(main_~length1~0 < 1); 225#L564-2 assume !(main_~length2~0 < 1); 219#L567-1 assume !(main_~n~0 < 1); 210#L570-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 211#L576 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L576 222#L576-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L576-1 218#L577 assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 212#L550-4 assume true; 213#L550-1 SUMMARY for call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L550-1 205#L550-2 assume !(cstrncat_#t~mem2 != 0);havoc cstrncat_#t~mem2; 206#L552-8 assume true; 221#L552 cstrncat_#t~short6 := cstrncat_~n != 0; 228#L552-1 assume !cstrncat_#t~short6; 209#L552-6 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, cstrncat_#t~post8.offset + 1;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 231#L552-8 assume true; 220#L552 [2018-10-27 06:11:25,533 INFO L795 eck$LassoCheckResult]: Loop: 220#L552 cstrncat_#t~short6 := cstrncat_~n != 0; 227#L552-1 assume !cstrncat_#t~short6; 214#L552-6 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, cstrncat_#t~post8.offset + 1;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 215#L552-8 assume true; 220#L552 [2018-10-27 06:11:25,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1206762798, now seen corresponding path program 1 times [2018-10-27 06:11:25,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:25,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:25,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:25,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:25,595 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:25,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2378489, now seen corresponding path program 1 times [2018-10-27 06:11:25,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:25,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:25,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:25,620 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:25,623 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-10-27 06:11:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:25,636 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-10-27 06:11:25,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:25,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-10-27 06:11:25,637 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:25,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:25,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:25,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:25,638 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:25,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:25,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:25,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:25,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:25 BoogieIcfgContainer [2018-10-27 06:11:25,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:25,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:25,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:25,644 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:25,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:22" (3/4) ... [2018-10-27 06:11:25,647 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:25,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:25,648 INFO L168 Benchmark]: Toolchain (without parser) took 4724.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -195.7 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:25,649 INFO L168 Benchmark]: CDTParser took 0.17 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-10-27 06:11:25,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.32 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:25,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -240.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:25,650 INFO L168 Benchmark]: Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:25,650 INFO L168 Benchmark]: RCFGBuilder took 603.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:25,651 INFO L168 Benchmark]: BuchiAutomizer took 3586.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -4.8 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:25,651 INFO L168 Benchmark]: Witness Printer took 3.56 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-10-27 06:11:25,659 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.17 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 393.32 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -240.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 603.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3586.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -4.8 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 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 (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 38 SDslu, 38 SDs, 0 SdLazy, 20 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital206 mio100 ax108 hnf98 lsp89 ukn92 mio100 lsp42 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 5 VariablesLoop: 0 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...