./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/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 32bit --witnessprinter.graph.data.programhash 8e5b411c800020cce3512b5f08fad6ae7c3970bd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:08:49,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:08:49,509 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:08:49,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:08:49,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:08:49,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:08:49,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:08:49,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:08:49,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:08:49,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:08:49,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:08:49,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:08:49,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:08:49,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:08:49,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:08:49,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:08:49,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:08:49,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:08:49,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:08:49,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:08:49,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:08:49,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:08:49,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:08:49,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:08:49,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:08:49,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:08:49,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:08:49,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:08:49,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:08:49,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:08:49,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:08:49,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:08:49,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:08:49,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:08:49,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:08:49,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:08:49,537 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:08:49,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:08:49,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:08:49,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:08:49,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:08:49,550 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:08:49,550 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:08:49,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:08:49,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:08:49,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:08:49,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:08:49,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:08:49,553 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:08:49,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:08:49,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:08:49,553 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:08:49,554 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:08:49,554 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_10ba1ee4-efa2-4c82-95c9-e5ca95818645/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e5b411c800020cce3512b5f08fad6ae7c3970bd [2018-11-18 10:08:49,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:08:49,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:08:49,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:08:49,590 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:08:49,590 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:08:49,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:08:49,626 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/data/1caad4aa1/d6d67992002a4217b38eb3c7f40f194c/FLAG4b83bf613 [2018-11-18 10:08:50,037 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:08:50,038 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:08:50,044 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/data/1caad4aa1/d6d67992002a4217b38eb3c7f40f194c/FLAG4b83bf613 [2018-11-18 10:08:50,052 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/bin-2019/uautomizer/data/1caad4aa1/d6d67992002a4217b38eb3c7f40f194c [2018-11-18 10:08:50,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:08:50,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:08:50,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:08:50,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:08:50,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:08:50,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ee2369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50, skipping insertion in model container [2018-11-18 10:08:50,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:08:50,095 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:08:50,279 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:08:50,286 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:08:50,351 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:08:50,382 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:08:50,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50 WrapperNode [2018-11-18 10:08:50,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:08:50,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:08:50,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:08:50,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:08:50,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:08:50,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:08:50,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:08:50,415 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:08:50,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... [2018-11-18 10:08:50,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:08:50,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:08:50,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:08:50,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:08:50,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10ba1ee4-efa2-4c82-95c9-e5ca95818645/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-18 10:08:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:08:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:08:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:08:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:08:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:08:50,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:08:50,691 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:08:50,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:50 BoogieIcfgContainer [2018-11-18 10:08:50,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:08:50,692 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:08:50,692 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:08:50,696 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:08:50,697 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:08:50,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:08:50" (1/3) ... [2018-11-18 10:08:50,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27789f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:08:50, skipping insertion in model container [2018-11-18 10:08:50,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:08:50,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:50" (2/3) ... [2018-11-18 10:08:50,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27789f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:08:50, skipping insertion in model container [2018-11-18 10:08:50,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:08:50,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:50" (3/3) ... [2018-11-18 10:08:50,701 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:08:50,736 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:08:50,736 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:08:50,736 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:08:50,736 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:08:50,736 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:08:50,737 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:08:50,737 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:08:50,737 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:08:50,737 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:08:50,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 10:08:50,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 10:08:50,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:08:50,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:08:50,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:08:50,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:08:50,767 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:08:50,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 10:08:50,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 10:08:50,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:08:50,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:08:50,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:08:50,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:08:50,774 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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; 4#L557true assume !(main_~length1~0 < 1); 6#L557-2true assume !(main_~length2~0 < 1); 22#L560-1true assume !(main_~n~0 < 1); 13#L563-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 18#L543-4true [2018-11-18 10:08:50,774 INFO L796 eck$LassoCheckResult]: Loop: 18#L543-4true assume true; 9#L543-1true call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 12#L543-2true assume !!(0 != cstrncat_#t~mem2);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, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 18#L543-4true [2018-11-18 10:08:50,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2018-11-18 10:08:50,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:50,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:50,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:50,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:50,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 58657, now seen corresponding path program 1 times [2018-11-18 10:08:50,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:50,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:50,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:50,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1302197843, now seen corresponding path program 1 times [2018-11-18 10:08:50,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:51,237 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-18 10:08:51,336 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:08:51,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:08:51,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:08:51,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:08:51,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:08:51,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:08:51,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:08:51,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:08:51,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 10:08:51,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:08:51,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:08:51,357 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-18 10:08:51,361 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-18 10:08:51,363 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-18 10:08:51,365 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-18 10:08:51,366 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-18 10:08:51,368 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-18 10:08:51,369 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-18 10:08:51,371 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-18 10:08:51,373 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-18 10:08:51,375 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-18 10:08:51,377 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-18 10:08:51,378 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-18 10:08:51,379 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-18 10:08:51,386 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-18 10:08:51,565 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-11-18 10:08:51,595 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-18 10:08:51,597 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-18 10:08:51,598 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-18 10:08:51,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:51,601 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-18 10:08:51,602 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-18 10:08:51,603 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-18 10:08:51,605 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-18 10:08:51,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:08:51,914 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:08:51,916 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-18 10:08:51,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,922 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-18 10:08:51,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:51,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:51,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,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-11-18 10:08:51,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,930 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-18 10:08:51,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,935 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-18 10:08:51,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,938 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-18 10:08:51,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,943 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-18 10:08:51,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:51,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:51,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,949 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-18 10:08:51,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,953 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-18 10:08:51,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,956 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-18 10:08:51,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,962 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-18 10:08:51,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,965 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-18 10:08:51,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,967 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-18 10:08:51,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:51,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:51,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:51,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,969 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-18 10:08:51,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:08:51,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,972 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:08:51,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:51,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,982 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-18 10:08:51,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:51,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:51,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,996 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-18 10:08:51,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:51,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:51,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:51,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:51,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:51,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:51,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:51,999 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-18 10:08:52,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:52,000 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:08:52,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:52,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:52,002 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:08:52,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:52,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:52,017 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-18 10:08:52,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:52,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:52,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:52,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:52,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:52,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:52,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:52,022 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-18 10:08:52,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:52,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:52,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:52,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:52,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:52,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:52,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:52,030 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-18 10:08:52,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:52,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:52,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:52,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:52,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:52,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:52,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:08:52,093 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:08:52,094 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:08:52,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:08:52,097 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:08:52,097 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:08:52,097 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2018-11-18 10:08:52,142 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 10:08:52,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:08:52,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:52,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:52,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:52,206 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-18 10:08:52,216 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-18 10:08:52,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2018-11-18 10:08:52,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 60 states and 82 transitions. Complement of second has 7 states. [2018-11-18 10:08:52,262 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-18 10:08:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:08:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 10:08:52,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 10:08:52,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:52,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 10:08:52,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:52,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 10:08:52,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:52,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 82 transitions. [2018-11-18 10:08:52,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:08:52,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 24 states and 31 transitions. [2018-11-18 10:08:52,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 10:08:52,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:08:52,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-18 10:08:52,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:08:52,275 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-18 10:08:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-18 10:08:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-18 10:08:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 10:08:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-18 10:08:52,295 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 10:08:52,295 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 10:08:52,295 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:08:52,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-18 10:08:52,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:08:52,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:08:52,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:08:52,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:52,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:08:52,297 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#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; 170#L557 assume !(main_~length1~0 < 1); 171#L557-2 assume !(main_~length2~0 < 1); 176#L560-1 assume !(main_~n~0 < 1); 188#L563-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 189#L543-4 assume true; 183#L543-1 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 184#L543-2 assume !(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2; 186#L545-5 assume true; 174#L545 cstrncat_#t~short6 := 0 != cstrncat_~n; 175#L545-1 assume cstrncat_#t~short6;cstrncat_#t~post4.base, cstrncat_#t~post4.offset := cstrncat_~s2.base, cstrncat_~s2.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#t~post4.base, 1 + cstrncat_#t~post4.offset;call cstrncat_#t~mem5 := read~int(cstrncat_#t~post4.base, cstrncat_#t~post4.offset, 1);call write~int(cstrncat_#t~mem5, cstrncat_~s~0.base, cstrncat_~s~0.offset, 1);cstrncat_#t~short6 := 0 != cstrncat_#t~mem5; 178#L545-3 assume !!cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;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, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 190#L545-5 assume true; 172#L545 [2018-11-18 10:08:52,297 INFO L796 eck$LassoCheckResult]: Loop: 172#L545 cstrncat_#t~short6 := 0 != cstrncat_~n; 173#L545-1 assume !cstrncat_#t~short6; 177#L545-3 assume !!cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;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, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 180#L545-5 assume true; 172#L545 [2018-11-18 10:08:52,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 21554959, now seen corresponding path program 1 times [2018-11-18 10:08:52,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:52,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:08:52,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2283161, now seen corresponding path program 1 times [2018-11-18 10:08:52,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:52,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:52,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:52,375 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-18 10:08:52,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:52,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:52,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:08:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:52,380 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-18 10:08:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:52,393 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 10:08:52,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:52,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-18 10:08:52,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:08:52,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2018-11-18 10:08:52,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:08:52,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:08:52,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:08:52,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:08:52,396 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:52,396 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:52,396 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:52,396 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:08:52,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:08:52,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:08:52,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:08:52,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:08:52 BoogieIcfgContainer [2018-11-18 10:08:52,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:08:52,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:08:52,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:08:52,402 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:08:52,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:50" (3/4) ... [2018-11-18 10:08:52,405 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:08:52,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:08:52,405 INFO L168 Benchmark]: Toolchain (without parser) took 2351.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -259.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:08:52,407 INFO L168 Benchmark]: CDTParser took 0.12 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-18 10:08:52,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:52,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.06 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:52,408 INFO L168 Benchmark]: Boogie Preprocessor took 16.43 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-18 10:08:52,408 INFO L168 Benchmark]: RCFGBuilder took 260.63 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:52,409 INFO L168 Benchmark]: BuchiAutomizer took 1709.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:08:52,409 INFO L168 Benchmark]: Witness Printer took 3.34 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-18 10:08:52,414 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.12 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 327.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.06 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.43 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 260.63 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1709.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.34 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 unknown-#length-unknown[s] + -1 * 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 1.6s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 29 SDslu, 29 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn76 mio100 lsp52 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 4 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...