./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c15bd857267d499e7ecc6e455c2b5fbe7515d7da .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:46:11,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:46:11,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:46:11,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:46:11,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:46:11,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:46:11,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:46:11,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:46:11,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:46:11,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:46:11,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:46:11,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:46:11,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:46:11,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:46:11,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:46:11,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:46:11,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:46:11,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:46:11,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:46:11,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:46:11,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:46:11,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:46:11,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:46:11,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:46:11,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:46:11,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:46:11,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:46:11,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:46:11,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:46:11,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:46:11,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:46:11,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:46:11,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:46:11,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:46:11,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:46:11,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:46:11,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:46:11,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:46:11,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:46:11,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:46:11,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:46:11,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:46:11,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:46:11,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:46:11,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:46:11,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:46:11,545 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:46:11,546 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:46:11,546 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:46:11,546 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:46:11,547 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:46:11,547 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:46:11,547 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:46:11,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:46:11,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:46:11,548 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:46:11,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:46:11,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:46:11,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:46:11,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:46:11,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:46:11,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:46:11,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:46:11,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:46:11,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:46:11,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:46:11,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:46:11,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:46:11,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:46:11,552 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:46:11,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:46:11,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:46:11,553 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:46:11,554 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:46:11,555 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c15bd857267d499e7ecc6e455c2b5fbe7515d7da [2019-11-15 22:46:11,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:46:11,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:46:11,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:46:11,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:46:11,615 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:46:11,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-15 22:46:11,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/data/7ac64c028/d90dc1581cb74bae857a15159a899952/FLAG4a5a6de49 [2019-11-15 22:46:12,146 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:46:12,147 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-15 22:46:12,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/data/7ac64c028/d90dc1581cb74bae857a15159a899952/FLAG4a5a6de49 [2019-11-15 22:46:12,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/data/7ac64c028/d90dc1581cb74bae857a15159a899952 [2019-11-15 22:46:12,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:46:12,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:46:12,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:46:12,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:46:12,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:46:12,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:46:12" (1/1) ... [2019-11-15 22:46:12,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b85dbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:12, skipping insertion in model container [2019-11-15 22:46:12,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:46:12" (1/1) ... [2019-11-15 22:46:12,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:46:12,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:46:12,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:46:12,980 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:46:13,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:46:13,090 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:46:13,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13 WrapperNode [2019-11-15 22:46:13,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:46:13,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:46:13,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:46:13,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:46:13,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:46:13,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:46:13,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:46:13,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:46:13,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... [2019-11-15 22:46:13,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:46:13,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:46:13,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:46:13,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:46:13,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:46:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:46:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:46:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:46:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:46:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:46:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:46:13,714 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:46:13,714 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:46:13,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:46:13 BoogieIcfgContainer [2019-11-15 22:46:13,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:46:13,717 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:46:13,717 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:46:13,720 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:46:13,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:46:13,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:46:12" (1/3) ... [2019-11-15 22:46:13,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6371a394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:46:13, skipping insertion in model container [2019-11-15 22:46:13,722 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:46:13,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:46:13" (2/3) ... [2019-11-15 22:46:13,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6371a394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:46:13, skipping insertion in model container [2019-11-15 22:46:13,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:46:13,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:46:13" (3/3) ... [2019-11-15 22:46:13,725 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2019-11-15 22:46:13,776 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:46:13,776 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:46:13,777 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:46:13,777 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:46:13,777 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:46:13,777 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:46:13,777 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:46:13,778 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:46:13,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 22:46:13,820 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:46:13,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:13,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:13,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:46:13,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:13,829 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:46:13,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 22:46:13,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 22:46:13,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:13,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:13,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:46:13,832 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:13,841 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 23#L527true assume !(main_~length1~0 < 1); 7#L527-2true assume !(main_~length2~0 < 2); 19#L530-1true assume !(main_~length3~0 < 1); 11#L533-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5#L540-3true [2019-11-15 22:46:13,842 INFO L793 eck$LassoCheckResult]: Loop: 5#L540-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 22#L540-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5#L540-3true [2019-11-15 22:46:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-15 22:46:13,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:13,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674944946] [2019-11-15 22:46:13,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:13,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:13,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,027 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-15 22:46:14,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:14,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235141617] [2019-11-15 22:46:14,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:14,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:14,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-15 22:46:14,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:14,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653828417] [2019-11-15 22:46:14,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:14,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:14,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:14,101 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:14,471 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:46:14,586 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 22:46:14,604 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:46:14,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:46:14,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:46:14,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:46:14,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:46:14,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:46:14,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:46:14,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:46:14,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-15 22:46:14,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:46:14,609 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:46:14,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,911 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 22:46:14,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:14,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:15,635 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:46:15,759 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:46:15,766 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:46:15,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,792 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,792 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,816 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,890 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,914 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,923 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:46:15,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,929 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:46:15,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:15,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:15,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:15,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:15,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:15,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:15,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:15,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:15,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:15,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:15,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:15,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:16,105 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:46:16,165 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:46:16,166 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 22:46:16,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:46:16,171 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:46:16,171 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:46:16,176 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~nondetString1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 22:46:16,202 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:46:16,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:46:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:16,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:46:16,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:16,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:46:16,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:16,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:46:16,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-15 22:46:16,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 52 states and 74 transitions. Complement of second has 7 states. [2019-11-15 22:46:16,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:46:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:46:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2019-11-15 22:46:16,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:46:16,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:16,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 22:46:16,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:16,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:46:16,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:16,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2019-11-15 22:46:16,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:46:16,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2019-11-15 22:46:16,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:46:16,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:46:16,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-15 22:46:16,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:16,512 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:46:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-15 22:46:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 22:46:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:46:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 22:46:16,549 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:46:16,549 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:46:16,549 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:46:16,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 22:46:16,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:46:16,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:16,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:16,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:46:16,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:16,554 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 160#L527 assume !(main_~length1~0 < 1); 156#L527-2 assume !(main_~length2~0 < 2); 157#L530-1 assume !(main_~length3~0 < 1); 161#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 151#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 153#L540-4 main_~i~1 := 0; 155#L545-3 [2019-11-15 22:46:16,554 INFO L793 eck$LassoCheckResult]: Loop: 155#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 158#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 155#L545-3 [2019-11-15 22:46:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-15 22:46:16,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:16,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276087239] [2019-11-15 22:46:16,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-15 22:46:16,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:16,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863495247] [2019-11-15 22:46:16,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-15 22:46:16,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:16,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409594321] [2019-11-15 22:46:16,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:16,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:17,002 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-15 22:46:17,113 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:46:17,115 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:46:17,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:46:17,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:46:17,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:46:17,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:46:17,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:46:17,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:46:17,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:46:17,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-15 22:46:17,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:46:17,116 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:46:17,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,360 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-15 22:46:17,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:17,901 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:46:17,960 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:46:17,960 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:46:17,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:17,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:17,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:17,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:17,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:17,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:17,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:17,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:17,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:17,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:17,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:17,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:46:17,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:17,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:17,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:17,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:46:17,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:46:17,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:17,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:17,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:17,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:17,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:17,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:17,969 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:17,969 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:17,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:17,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:17,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:17,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:17,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:17,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:17,984 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:17,984 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:18,018 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:46:18,055 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:46:18,055 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:46:18,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:46:18,057 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:46:18,057 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:46:18,057 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 22:46:18,077 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:46:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:18,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:46:18,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:18,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:46:18,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:18,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:46:18,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:46:18,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 24 states and 36 transitions. Complement of second has 6 states. [2019-11-15 22:46:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:46:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:46:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-15 22:46:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 22:46:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 22:46:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 22:46:18,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:18,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2019-11-15 22:46:18,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:46:18,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2019-11-15 22:46:18,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:46:18,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:46:18,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 22:46:18,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:18,162 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:46:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 22:46:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 22:46:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:46:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-15 22:46:18,164 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:46:18,164 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:46:18,164 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:46:18,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-15 22:46:18,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:46:18,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:18,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:18,166 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:46:18,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:18,166 INFO L791 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 278#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 279#L527 assume !(main_~length1~0 < 1); 274#L527-2 assume !(main_~length2~0 < 2); 275#L530-1 assume !(main_~length3~0 < 1); 280#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 269#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 271#L540-4 main_~i~1 := 0; 273#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 281#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 268#L517-3 [2019-11-15 22:46:18,166 INFO L793 eck$LassoCheckResult]: Loop: 268#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 266#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 268#L517-3 [2019-11-15 22:46:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-15 22:46:18,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:18,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125962979] [2019-11-15 22:46:18,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:18,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125962979] [2019-11-15 22:46:18,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:46:18,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:46:18,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993687128] [2019-11-15 22:46:18,262 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:46:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-11-15 22:46:18,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:18,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173787647] [2019-11-15 22:46:18,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,289 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:18,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:46:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:46:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:46:18,348 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 22:46:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:46:18,392 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-15 22:46:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:46:18,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 22:46:18,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:46:18,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 22:46:18,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:46:18,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:46:18,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 22:46:18,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:18,396 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:46:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 22:46:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 22:46:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:46:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 22:46:18,398 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:46:18,398 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:46:18,398 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:46:18,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 22:46:18,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:46:18,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:18,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:18,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:46:18,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:18,400 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 323#L527 assume !(main_~length1~0 < 1); 318#L527-2 assume !(main_~length2~0 < 2); 319#L530-1 assume !(main_~length3~0 < 1); 324#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 313#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 315#L540-4 main_~i~1 := 0; 317#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 320#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 321#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 325#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 312#L517-3 [2019-11-15 22:46:18,402 INFO L793 eck$LassoCheckResult]: Loop: 312#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 310#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 312#L517-3 [2019-11-15 22:46:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-15 22:46:18,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:18,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361394960] [2019-11-15 22:46:18,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,433 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-11-15 22:46:18,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:18,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630020044] [2019-11-15 22:46:18,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:18,441 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:18,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2019-11-15 22:46:18,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:18,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349720153] [2019-11-15 22:46:18,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:18,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:18,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349720153] [2019-11-15 22:46:18,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945006520] [2019-11-15 22:46:18,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0012f51c-f237-4421-b34f-6678c5f50c40/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:46:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:18,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:46:18,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:19,181 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-15 22:46:19,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 22:46:19,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:46:19,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:46:19,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 22:46:19,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2019-11-15 22:46:19,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:46:19,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:46:19,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2019-11-15 22:46:19,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:46:19,367 INFO L567 ElimStorePlain]: treesize reduction 33, result has 42.1 percent of original size [2019-11-15 22:46:19,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:46:19,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:48, output treesize:3 [2019-11-15 22:46:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:19,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:46:19,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-15 22:46:19,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548730786] [2019-11-15 22:46:19,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:46:19,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:46:19,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:46:19,416 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-11-15 22:46:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:46:21,129 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-11-15 22:46:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:46:21,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-15 22:46:21,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:46:21,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 22:46:21,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:46:21,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:46:21,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 22:46:21,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:21,133 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 22:46:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 22:46:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-15 22:46:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:46:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 22:46:21,136 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:46:21,136 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:46:21,136 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:46:21,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-15 22:46:21,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:46:21,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:21,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:21,138 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:46:21,138 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:21,139 INFO L791 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 440#L527 assume !(main_~length1~0 < 1); 433#L527-2 assume !(main_~length2~0 < 2); 434#L530-1 assume !(main_~length3~0 < 1); 441#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 428#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 430#L540-4 main_~i~1 := 0; 432#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 437#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 438#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 442#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 447#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 426#L517-1 assume !(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2; 427#L519-2 [2019-11-15 22:46:21,139 INFO L793 eck$LassoCheckResult]: Loop: 427#L519-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 446#L519 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~mem6; 427#L519-2 [2019-11-15 22:46:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2019-11-15 22:46:21,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654318895] [2019-11-15 22:46:21,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2019-11-15 22:46:21,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957841036] [2019-11-15 22:46:21,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2019-11-15 22:46:21,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960857222] [2019-11-15 22:46:21,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:46:21,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960857222] [2019-11-15 22:46:21,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:46:21,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:46:21,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363176714] [2019-11-15 22:46:21,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:46:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:46:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:46:21,446 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:46:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:46:21,535 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-11-15 22:46:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:46:21,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-11-15 22:46:21,537 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:46:21,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2019-11-15 22:46:21,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 22:46:21,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:46:21,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-11-15 22:46:21,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:21,539 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-15 22:46:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-11-15 22:46:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-15 22:46:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:46:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-15 22:46:21,551 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 22:46:21,551 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 22:46:21,552 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:46:21,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-15 22:46:21,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 22:46:21,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:46:21,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:46:21,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:46:21,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:46:21,555 INFO L791 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 518#L527 assume !(main_~length1~0 < 1); 511#L527-2 assume !(main_~length2~0 < 2); 512#L530-1 assume !(main_~length3~0 < 1); 519#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 505#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 507#L540-4 main_~i~1 := 0; 510#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 531#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 530#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 529#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 528#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 527#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 504#L517-3 [2019-11-15 22:46:21,555 INFO L793 eck$LassoCheckResult]: Loop: 504#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 503#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 504#L517-3 [2019-11-15 22:46:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2019-11-15 22:46:21,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819986856] [2019-11-15 22:46:21,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,608 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2019-11-15 22:46:21,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67133345] [2019-11-15 22:46:21,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2019-11-15 22:46:21,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:46:21,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255340691] [2019-11-15 22:46:21,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:46:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:46:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:46:21,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:46:22,669 WARN L191 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-11-15 22:46:22,955 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 22:46:22,958 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:46:22,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:46:22,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:46:22,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:46:22,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:46:22,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:46:22,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:46:22,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:46:22,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2019-11-15 22:46:22,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:46:22,959 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:46:22,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,371 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-11-15 22:46:23,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:46:23,735 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 22:46:24,391 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 22:46:24,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:46:24,461 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:46:24,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:24,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:24,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:24,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:24,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:24,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:24,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:24,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:24,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:24,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:24,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:24,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:24,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:24,470 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:24,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:24,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:46:24,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:46:24,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:46:24,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:46:24,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:46:24,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:46:24,483 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:46:24,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:46:24,518 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:46:24,538 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:46:24,538 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:46:24,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:46:24,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:46:24,540 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:46:24,540 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2019-11-15 22:46:24,581 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 22:46:24,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:46:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:46:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:24,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:46:24,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:46:24,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:46:24,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:46:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:46:24,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:46:24,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 22:46:24,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 40 states and 52 transitions. Complement of second has 6 states. [2019-11-15 22:46:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:46:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:46:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 22:46:24,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 22:46:24,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:24,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 22:46:24,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:24,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 22:46:24,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:46:24,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-15 22:46:24,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:46:24,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-15 22:46:24,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:46:24,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:46:24,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:46:24,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:46:24,687 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:46:24,687 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:46:24,687 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:46:24,687 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:46:24,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:46:24,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:46:24,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:46:24,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:46:24 BoogieIcfgContainer [2019-11-15 22:46:24,693 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:46:24,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:46:24,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:46:24,694 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:46:24,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:46:13" (3/4) ... [2019-11-15 22:46:24,698 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:46:24,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:46:24,700 INFO L168 Benchmark]: Toolchain (without parser) took 12249.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 940.7 MB in the beginning and 995.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 278.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:46:24,700 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:46:24,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:46:24,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:46:24,702 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:46:24,703 INFO L168 Benchmark]: RCFGBuilder took 508.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:46:24,703 INFO L168 Benchmark]: BuchiAutomizer took 10976.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 102.2 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:46:24,704 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.4 GB. Free memory is still 995.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:46:24,707 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.85 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 508.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10976.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 102.2 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.4 GB. Free memory is still 995.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + unknown-#length-unknown[nondetString1] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.4s. Construction of modules took 1.5s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 189 SDslu, 168 SDs, 0 SdLazy, 177 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax110 hnf98 lsp84 ukn75 mio100 lsp57 div100 bol100 ite100 ukn100 eq165 hnf91 smp97 dnf148 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...