./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 217963df20137e939d67fe2243ee5b5bf7e9133e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:03:58,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:03:58,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:03:58,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:03:58,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:03:58,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:03:58,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:03:58,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:03:58,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:03:58,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:03:58,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:03:58,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:03:58,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:03:58,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:03:59,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:03:59,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:03:59,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:03:59,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:03:59,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:03:59,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:03:59,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:03:59,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:03:59,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:03:59,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:03:59,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:03:59,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:03:59,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:03:59,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:03:59,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:03:59,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:03:59,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:03:59,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:03:59,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:03:59,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:03:59,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:03:59,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:03:59,030 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:03:59,049 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:03:59,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:03:59,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:03:59,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:03:59,050 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:03:59,051 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:03:59,051 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:03:59,051 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:03:59,051 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:03:59,051 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:03:59,051 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:03:59,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:03:59,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:03:59,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:03:59,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:03:59,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:03:59,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:03:59,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:03:59,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:03:59,054 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:03:59,054 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:03:59,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:03:59,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:03:59,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:03:59,056 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:03:59,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:03:59,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:03:59,056 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:03:59,057 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:03:59,057 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 217963df20137e939d67fe2243ee5b5bf7e9133e [2019-01-01 22:03:59,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:03:59,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:03:59,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:03:59,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:03:59,127 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:03:59,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i [2019-01-01 22:03:59,189 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3532dcdff/c4122f0630c7452da3c887293bd1ea8b/FLAGba1cf3b4e [2019-01-01 22:03:59,770 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:03:59,771 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i [2019-01-01 22:03:59,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3532dcdff/c4122f0630c7452da3c887293bd1ea8b/FLAGba1cf3b4e [2019-01-01 22:04:00,029 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3532dcdff/c4122f0630c7452da3c887293bd1ea8b [2019-01-01 22:04:00,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:04:00,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:04:00,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:00,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:04:00,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:04:00,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b06401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00, skipping insertion in model container [2019-01-01 22:04:00,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:04:00,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:04:00,503 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:00,519 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:04:00,595 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:00,751 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:04:00,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00 WrapperNode [2019-01-01 22:04:00,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:00,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:00,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:04:00,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:04:00,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:00,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:04:00,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:04:00,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:04:00,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... [2019-01-01 22:04:00,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:04:00,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:04:00,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:04:00,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:04:00,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 22:04:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:04:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:04:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:04:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:04:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:04:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:04:01,370 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:04:01,370 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:04:01,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:01 BoogieIcfgContainer [2019-01-01 22:04:01,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:04:01,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:04:01,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:04:01,376 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:04:01,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:01,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:04:00" (1/3) ... [2019-01-01 22:04:01,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf889eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:01, skipping insertion in model container [2019-01-01 22:04:01,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:01,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:00" (2/3) ... [2019-01-01 22:04:01,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf889eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:01, skipping insertion in model container [2019-01-01 22:04:01,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:01,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:01" (3/3) ... [2019-01-01 22:04:01,381 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_reverse_alloca_true-termination.c.i [2019-01-01 22:04:01,438 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:04:01,439 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:04:01,439 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:04:01,440 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:04:01,440 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:04:01,440 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:04:01,440 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:04:01,440 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:04:01,440 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:04:01,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:01,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:04:01,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:01,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:01,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:01,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:04:01,490 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:04:01,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:01,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 22:04:01,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:01,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:01,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:01,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:04:01,500 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); 6#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.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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 [2019-01-01 22:04:01,500 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 4#L367-1true assume !!(0 != 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, cstrncat_#t~post206.offset - 1;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-01-01 22:04:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-01 22:04:01,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:01,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-01 22:04:01,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-01 22:04:01,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:02,749 WARN L181 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2019-01-01 22:04:03,164 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 22:04:03,175 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:04:03,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:04:03,177 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:04:03,177 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:04:03,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:04:03,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:04:03,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:04:03,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:04:03,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:04:03,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:04:03,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:04:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,751 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-01 22:04:03,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:03,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:04,057 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 22:04:05,020 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:04:05,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:04:05,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:04:05,089 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 [2019-01-01 22:04:05,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,099 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 [2019-01-01 22:04:05,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:05,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:05,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,108 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 [2019-01-01 22:04:05,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,113 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 [2019-01-01 22:04:05,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,118 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 [2019-01-01 22:04:05,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,123 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 [2019-01-01 22:04:05,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,128 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 [2019-01-01 22:04:05,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,133 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 [2019-01-01 22:04:05,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,138 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 [2019-01-01 22:04:05,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:05,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:05,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,147 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 [2019-01-01 22:04:05,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,152 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 [2019-01-01 22:04:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,157 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 [2019-01-01 22:04:05,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,162 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 [2019-01-01 22:04:05,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:05,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:05,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:05,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,166 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 [2019-01-01 22:04:05,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:05,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:05,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:05,175 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 [2019-01-01 22:04:05,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:05,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:05,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:05,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:05,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:05,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:05,327 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:04:05,362 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:04:05,362 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:04:05,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:04:05,366 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:04:05,367 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:04:05,368 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 + 2*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-01-01 22:04:05,473 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 22:04:05,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:04:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:05,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:05,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:05,690 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-01-01 22:04:05,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-01 22:04:05,818 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. [2019-01-01 22:04:05,819 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-01-01 22:04:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:04:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2019-01-01 22:04:05,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 22:04:05,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:05,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 22:04:05,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:05,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 22:04:05,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:05,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2019-01-01 22:04:05,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:04:05,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2019-01-01 22:04:05,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:04:05,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:04:05,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-01 22:04:05,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:04:05,838 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 22:04:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-01 22:04:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-01 22:04:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 22:04:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-01 22:04:05,863 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:04:05,863 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:04:05,864 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:04:05,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-01 22:04:05,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:04:05,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:05,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:05,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:04:05,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:04:05,867 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 153#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; 154#L381 assume !(main_~length1~0 < 1); 163#L381-2 assume !(main_~length2~0 < 1); 169#L384-1 assume !(main_~n~0 < 1); 164#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.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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; 165#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 155#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 156#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 171#L369 assume !cstrncat_#t~short209; 167#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;havoc cstrncat_#t~mem208;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, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 170#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 160#L369 [2019-01-01 22:04:05,867 INFO L796 eck$LassoCheckResult]: Loop: 160#L369 assume !cstrncat_#t~short209; 166#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;havoc cstrncat_#t~mem208;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, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 159#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 160#L369 [2019-01-01 22:04:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-01-01 22:04:05,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:05,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:05,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:04:05,945 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:04:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-01-01 22:04:05,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:05,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:05,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:05,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:05,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:04:05,963 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:04:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:04:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:04:05,967 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:04:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:04:05,981 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-01 22:04:05,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:04:05,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-01 22:04:05,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:05,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-01 22:04:05,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:04:05,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:04:05,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:04:05,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:05,985 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:05,986 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:05,986 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:05,986 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:04:05,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:04:05,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:05,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:04:05,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:04:05 BoogieIcfgContainer [2019-01-01 22:04:05,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:04:05,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:04:05,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:04:05,993 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:04:05,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:01" (3/4) ... [2019-01-01 22:04:05,998 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:04:05,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:04:05,999 INFO L168 Benchmark]: Toolchain (without parser) took 5965.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:06,001 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:06,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:06,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.91 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:06,004 INFO L168 Benchmark]: Boogie Preprocessor took 52.28 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-01-01 22:04:06,004 INFO L168 Benchmark]: RCFGBuilder took 513.94 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.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:06,005 INFO L168 Benchmark]: BuchiAutomizer took 4620.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:06,007 INFO L168 Benchmark]: Witness Printer took 5.59 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-01-01 22:04:06,013 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.91 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.28 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 513.94 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.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4620.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.59 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. * 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))] + 2 * 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 4.5s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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: inital200 mio100 ax100 hnf99 lsp96 ukn83 mio100 lsp55 div100 bol100 ite100 ukn100 eq194 hnf89 smp100 dnf158 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...