./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0e48acfd964328d443bb00db1a9e4c58c0207581 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:59:04,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:59:04,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:59:04,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:59:04,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:59:04,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:59:04,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:59:04,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:59:04,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:59:04,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:59:04,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:59:04,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:59:04,080 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:59:04,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:59:04,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:59:04,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:59:04,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:59:04,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:59:04,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:59:04,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:59:04,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:59:04,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:59:04,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:59:04,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:59:04,089 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:59:04,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:59:04,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:59:04,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:59:04,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:59:04,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:59:04,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:59:04,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:59:04,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:59:04,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:59:04,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:59:04,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:59:04,094 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:59:04,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:59:04,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:59:04,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:59:04,104 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:59:04,104 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:59:04,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:59:04,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:59:04,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:59:04,106 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:59:04,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:59:04,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:59:04,107 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:59:04,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:59:04,108 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e48acfd964328d443bb00db1a9e4c58c0207581 [2018-11-23 06:59:04,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:59:04,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:59:04,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:59:04,143 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:59:04,143 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:59:04,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-23 06:59:04,182 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/data/98b3aecb3/7d2578ee975844488d8e4a11aa1e247d/FLAGe1a3eaa3d [2018-11-23 06:59:04,642 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:59:04,643 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-23 06:59:04,650 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/data/98b3aecb3/7d2578ee975844488d8e4a11aa1e247d/FLAGe1a3eaa3d [2018-11-23 06:59:05,160 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/data/98b3aecb3/7d2578ee975844488d8e4a11aa1e247d [2018-11-23 06:59:05,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:59:05,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:59:05,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:59:05,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:59:05,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:59:05,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ab206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05, skipping insertion in model container [2018-11-23 06:59:05,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:59:05,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:59:05,397 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:59:05,403 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:59:05,476 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:59:05,518 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:59:05,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05 WrapperNode [2018-11-23 06:59:05,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:59:05,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:59:05,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:59:05,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:59:05,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:59:05,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:59:05,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:59:05,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:59:05,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... [2018-11-23 06:59:05,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:59:05,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:59:05,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:59:05,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:59:05,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a525ab7-92fe-4e15-a619-9be99578500e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:59:05,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:59:05,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:59:05,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:59:05,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:59:05,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:59:05,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:59:05,781 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:59:05,781 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:59:05,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:59:05 BoogieIcfgContainer [2018-11-23 06:59:05,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:59:05,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:59:05,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:59:05,784 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:59:05,785 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:59:05,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:59:05" (1/3) ... [2018-11-23 06:59:05,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d29d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:59:05, skipping insertion in model container [2018-11-23 06:59:05,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:59:05,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:59:05" (2/3) ... [2018-11-23 06:59:05,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d29d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:59:05, skipping insertion in model container [2018-11-23 06:59:05,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:59:05,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:59:05" (3/3) ... [2018-11-23 06:59:05,788 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca_true-termination.c.i [2018-11-23 06:59:05,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:59:05,821 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:59:05,821 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:59:05,821 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:59:05,821 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:59:05,821 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:59:05,821 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:59:05,821 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:59:05,821 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:59:05,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:59:05,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:59:05,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:59:05,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:59:05,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:59:05,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:59:05,851 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:59:05,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:59:05,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:59:05,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:59:05,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:59:05,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:59:05,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:59:05,860 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 5#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2018-11-23 06:59:05,860 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 3#L367-1true assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2018-11-23 06:59:05,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2018-11-23 06:59:05,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:59:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:59:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:59:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:05,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-23 06:59:05,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:59:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:59:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:59:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:05,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2018-11-23 06:59:05,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:59:05,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:59:05,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:59:05,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:59:06,297 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-23 06:59:06,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:59:06,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:59:06,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:59:06,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:59:06,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:59:06,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:59:06,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:59:06,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:59:06,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 06:59:06,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:59:06,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:59:06,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,622 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-23 06:59:06,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:59:06,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:59:06,978 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:59:06,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:06,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:06,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:06,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:06,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:06,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:06,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:06,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:06,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:06,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:06,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:06,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:06,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:06,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:06,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:59:06,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:59:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:06,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:06,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:06,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:06,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:06,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:06,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:06,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:06,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:06,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:06,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:06,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:06,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:06,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:06,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:06,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:06,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:06,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:06,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:06,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:06,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:06,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:06,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:06,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:06,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:06,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:06,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:06,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:07,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:07,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:07,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:07,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:07,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:07,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:07,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:07,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:07,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:07,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:59:07,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:07,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:59:07,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:59:07,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:07,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:07,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:59:07,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:59:07,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:07,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,012 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:59:07,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:59:07,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:59:07,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:59:07,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:59:07,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:59:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:59:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:59:07,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:59:07,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:59:07,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:59:07,068 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:59:07,098 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:59:07,099 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:59:07,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:59:07,101 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:59:07,101 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:59:07,102 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2018-11-23 06:59:07,142 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 06:59:07,148 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:59:07,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:59:07,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:59:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:59:07,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:59:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:59:07,216 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:59:07,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-23 06:59:07,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 50 states and 73 transitions. Complement of second has 8 states. [2018-11-23 06:59:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:59:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:59:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-23 06:59:07,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 06:59:07,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:59:07,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 06:59:07,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:59:07,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 06:59:07,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:59:07,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2018-11-23 06:59:07,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:59:07,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2018-11-23 06:59:07,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 06:59:07,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:59:07,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-23 06:59:07,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:59:07,303 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 06:59:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-23 06:59:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 06:59:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 06:59:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-11-23 06:59:07,321 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 06:59:07,321 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 06:59:07,321 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:59:07,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-11-23 06:59:07,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:59:07,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:59:07,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:59:07,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:59:07,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:59:07,322 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 162#L381 assume !(main_~length1~0 < 1); 167#L381-2 assume !(main_~length2~0 < 1); 177#L384-1 assume !(main_~n~0 < 1); 172#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 173#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 163#L367-1 assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 164#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 179#L369 assume !cstrncat_#t~short209; 175#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 178#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 169#L369 [2018-11-23 06:59:07,323 INFO L796 eck$LassoCheckResult]: Loop: 169#L369 assume !cstrncat_#t~short209; 174#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 168#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 169#L369 [2018-11-23 06:59:07,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2018-11-23 06:59:07,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:59:07,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:59:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:59:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:59:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:59:07,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:59:07,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:59:07,363 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:59:07,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:59:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2018-11-23 06:59:07,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:59:07,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:59:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:07,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:59:07,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:59:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:59:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:59:07,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:59:07,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:59:07,380 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:59:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:59:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:59:07,383 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 06:59:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:59:07,397 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-23 06:59:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:59:07,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-11-23 06:59:07,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:59:07,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:59:07,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:59:07,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:59:07,399 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:59:07,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:59:07,399 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:59:07,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:59:07,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:59:07 BoogieIcfgContainer [2018-11-23 06:59:07,403 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:59:07,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:59:07,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:59:07,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:59:07,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:59:05" (3/4) ... [2018-11-23 06:59:07,406 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:59:07,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:59:07,407 INFO L168 Benchmark]: Toolchain (without parser) took 2243.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -92.8 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:59:07,408 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:59:07,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:59:07,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:59:07,409 INFO L168 Benchmark]: Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:59:07,409 INFO L168 Benchmark]: RCFGBuilder took 216.13 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:59:07,410 INFO L168 Benchmark]: BuchiAutomizer took 1621.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:59:07,410 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:59:07,415 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.22 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 216.13 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1621.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 35 SDslu, 20 SDs, 0 SdLazy, 19 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn76 mio100 lsp52 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...