./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-memory-alloca/openbsd_cstrlcpy-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 6d213bb73df5e8110170d83073afe858aea401c0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:20,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:20,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:20,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:20,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:20,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:20,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:20,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:20,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:20,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:20,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:20,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:20,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:20,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:20,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:20,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:20,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:20,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:20,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:20,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:20,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:20,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:20,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:20,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:20,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:20,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:20,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:20,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:20,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:20,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:20,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:20,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:20,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:20,382 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:20,383 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:20,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:20,384 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:20,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:20,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:20,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:20,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:20,403 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:20,403 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:20,403 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:20,403 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:20,404 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:20,404 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:20,404 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:20,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:20,404 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:20,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:20,405 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:20,406 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:20,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:20,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:20,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:20,406 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:20,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:20,407 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:20,407 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:20,408 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:20,408 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 -> 6d213bb73df5e8110170d83073afe858aea401c0 [2018-11-28 23:21:20,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:20,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:20,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:20,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:20,471 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:20,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-28 23:21:20,532 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ec24ade/456894b817b242f5b48d7e555e17b266/FLAGe0bbe961c [2018-11-28 23:21:21,022 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:21,024 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-28 23:21:21,043 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ec24ade/456894b817b242f5b48d7e555e17b266/FLAGe0bbe961c [2018-11-28 23:21:21,327 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ec24ade/456894b817b242f5b48d7e555e17b266 [2018-11-28 23:21:21,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:21,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:21,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:21,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:21,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:21,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:21,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308ccefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21, skipping insertion in model container [2018-11-28 23:21:21,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:21,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:21,414 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:21,788 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:21,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:21,889 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:21,966 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:21,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21 WrapperNode [2018-11-28 23:21:21,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:21,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:21,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:21,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:22,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:22,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:22,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:22,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:22,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (1/1) ... [2018-11-28 23:21:22,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:22,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:22,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:22,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:22,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (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 [2018-11-28 23:21:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:22,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:22,811 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:22,811 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:22,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:22 BoogieIcfgContainer [2018-11-28 23:21:22,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:22,813 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:22,813 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:22,817 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:22,818 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:22,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:21" (1/3) ... [2018-11-28 23:21:22,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f26f9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:22, skipping insertion in model container [2018-11-28 23:21:22,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:22,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:21" (2/3) ... [2018-11-28 23:21:22,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f26f9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:22, skipping insertion in model container [2018-11-28 23:21:22,821 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:22,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:22" (3/3) ... [2018-11-28 23:21:22,824 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-28 23:21:22,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:22,881 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:22,881 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:22,881 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:22,881 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:22,881 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:22,881 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:22,882 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:22,882 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:22,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:21:22,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:21:22,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:22,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:22,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:21:22,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:22,925 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:22,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:21:22,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:21:22,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:22,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:22,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:21:22,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:22,936 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 19#L570true assume !(main_~length~0 < 1); 3#L570-2true assume !(main_~n~1 < 1); 13#L573-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7#L553true assume 0 != cstrlcpy_~n~0 % 4294967296; 12#L554-3true [2018-11-28 23:21:22,937 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 8#L554-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 4#L555true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset; 12#L554-3true [2018-11-28 23:21:22,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-28 23:21:22,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:22,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2018-11-28 23:21:23,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2018-11-28 23:21:23,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:23,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:23,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:23,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:23,550 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:21:24,741 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-28 23:21:24,987 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 23:21:25,010 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:25,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:25,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:25,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:25,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:25,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:25,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:25,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:25,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:21:25,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:25,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:25,048 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-28 23:21:25,079 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-28 23:21:25,105 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-28 23:21:25,131 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-28 23:21:25,152 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-28 23:21:25,161 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-28 23:21:25,716 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-11-28 23:21:26,073 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-28 23:21:26,074 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-28 23:21:26,077 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-28 23:21:26,081 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-28 23:21:26,083 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-28 23:21:26,088 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-28 23:21:26,090 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-28 23:21:26,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:26,111 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-28 23:21:26,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:26,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:26,126 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-28 23:21:26,129 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-28 23:21:26,143 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-28 23:21:26,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:26,809 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-28 23:21:27,167 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-28 23:21:27,688 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-28 23:21:27,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:27,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:27,810 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-28 23:21:27,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:27,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:27,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:27,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,820 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-28 23:21:27,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:27,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,822 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-28 23:21:27,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:27,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,825 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-28 23:21:27,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,834 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-28 23:21:27,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:21:27,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:21:27,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,840 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-28 23:21:27,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:27,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:27,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:27,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,843 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-28 23:21:27,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,854 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-28 23:21:27,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,862 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-28 23:21:27,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,862 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:27,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,869 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:27,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,898 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-28 23:21:27,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,908 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-28 23:21:27,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,915 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-28 23:21:27,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:27,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:27,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:27,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:27,952 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-28 23:21:27,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:27,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:27,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:27,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:27,963 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:27,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:28,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:28,003 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-28 23:21:28,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:28,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:28,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:28,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:28,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:28,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:28,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:28,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:21:28,209 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:28,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:28,214 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:28,215 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:28,215 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-11-28 23:21:28,465 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:21:28,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:28,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:28,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:28,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:28,652 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-28 23:21:28,667 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:21:28,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-11-28 23:21:28,798 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 49 states and 70 transitions. Complement of second has 7 states. [2018-11-28 23:21:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:21:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-28 23:21:28,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:21:28,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:28,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:21:28,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:28,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:21:28,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:28,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-11-28 23:21:28,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:28,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2018-11-28 23:21:28,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:28,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:28,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:21:28,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:28,820 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:21:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:21:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:21:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:21:28,848 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:28,848 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:28,848 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:28,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:21:28,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:28,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:28,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:28,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:28,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:21:28,850 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 191#L570 assume !(main_~length~0 < 1); 195#L570-2 assume !(main_~n~1 < 1); 196#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 192#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 193#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 197#L560 assume !(0 != cstrlcpy_~siz % 4294967296); 199#L562-2 [2018-11-28 23:21:28,850 INFO L796 eck$LassoCheckResult]: Loop: 199#L562-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 198#L562 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 199#L562-2 [2018-11-28 23:21:28,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2018-11-28 23:21:28,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:28,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:28,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2018-11-28 23:21:28,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:28,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:28,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:28,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2018-11-28 23:21:28,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:28,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:29,047 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:21:29,383 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2018-11-28 23:21:29,560 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 23:21:29,563 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:29,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:29,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:29,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:29,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:29,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:29,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:29,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:29,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:29,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:29,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:29,570 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-28 23:21:29,588 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-28 23:21:29,589 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-28 23:21:29,916 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 23:21:29,994 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-28 23:21:29,998 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-28 23:21:30,000 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-28 23:21:30,004 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-28 23:21:30,006 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-28 23:21:30,009 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-28 23:21:30,012 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-28 23:21:30,014 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-28 23:21:30,017 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-28 23:21:30,021 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-28 23:21:30,024 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-28 23:21:30,026 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-28 23:21:30,028 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-28 23:21:30,030 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-28 23:21:30,033 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-28 23:21:30,036 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-28 23:21:30,038 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-28 23:21:30,192 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-28 23:21:30,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:30,913 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:30,913 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-28 23:21:30,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:30,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:30,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:30,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:30,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:30,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:30,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:30,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,918 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-28 23:21:30,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:30,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:30,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,939 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-28 23:21:30,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,942 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-28 23:21:30,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,946 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-28 23:21:30,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:30,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,949 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:30,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,951 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:30,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:30,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,961 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:30,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,963 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:30,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,971 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-28 23:21:30,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:30,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,972 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:21:30,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:21:30,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:30,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:30,974 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-28 23:21:30,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:30,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:30,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:30,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:30,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:30,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:30,991 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:31,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:31,002 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:21:31,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:31,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:31,004 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:31,004 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-11-28 23:21:31,172 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:21:31,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:31,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:31,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:31,360 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-28 23:21:31,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:21:31,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:21:31,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-11-28 23:21:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:21:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:21:31,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:21:31,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:31,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:21:31,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:31,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:21:31,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:31,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 23:21:31,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:31,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2018-11-28 23:21:31,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:31,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:31,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-28 23:21:31,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:31,402 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:21:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-28 23:21:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:21:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:21:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:21:31,404 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:21:31,404 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:21:31,404 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:31,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:21:31,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:31,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:31,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:31,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:31,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:21:31,406 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 308#L570 assume !(main_~length~0 < 1); 313#L570-2 assume !(main_~n~1 < 1); 314#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 309#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 310#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 312#L560 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 316#L562-2 [2018-11-28 23:21:31,406 INFO L796 eck$LassoCheckResult]: Loop: 316#L562-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 315#L562 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 316#L562-2 [2018-11-28 23:21:31,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2018-11-28 23:21:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:31,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:31,691 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-11-28 23:21:31,705 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-28 23:21:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:31,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:21:31,709 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:21:31,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2018-11-28 23:21:31,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:31,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:21:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:21:31,815 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:21:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:31,830 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-11-28 23:21:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:21:31,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-11-28 23:21:31,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:31,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2018-11-28 23:21:31,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:21:31,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:21:31,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:21:31,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:31,835 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:31,835 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:31,836 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:31,836 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:21:31,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:21:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:21:31,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:31 BoogieIcfgContainer [2018-11-28 23:21:31,843 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:21:31,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:21:31,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:21:31,844 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:21:31,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:22" (3/4) ... [2018-11-28 23:21:31,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:21:31,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:21:31,850 INFO L168 Benchmark]: Toolchain (without parser) took 10517.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -278.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:31,851 INFO L168 Benchmark]: CDTParser took 0.13 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. [2018-11-28 23:21:31,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:31,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 200.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:31,853 INFO L168 Benchmark]: Boogie Preprocessor took 66.80 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-28 23:21:31,854 INFO L168 Benchmark]: RCFGBuilder took 576.64 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:31,855 INFO L168 Benchmark]: BuchiAutomizer took 9030.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.9 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:31,856 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:21:31,861 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.13 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 632.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 200.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.80 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 576.64 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9030.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.9 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * s and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 42 SDslu, 28 SDs, 0 SdLazy, 19 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax108 hnf99 lsp90 ukn83 mio100 lsp41 div171 bol100 ite100 ukn100 eq172 hnf66 smp95 dnf100 smp100 tf101 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 5 VariablesLoop: 4 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...