./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:19:52,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:19:52,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:19:52,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:19:52,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:19:52,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:19:52,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:19:52,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:19:52,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:19:52,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:19:52,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:19:52,668 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:19:52,669 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:19:52,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:19:52,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:19:52,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:19:52,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:19:52,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:19:52,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:19:52,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:19:52,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:19:52,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:19:52,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:19:52,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:19:52,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:19:52,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:19:52,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:19:52,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:19:52,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:19:52,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:19:52,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:19:52,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:19:52,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:19:52,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:19:52,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:19:52,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:19:52,684 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:19:52,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:19:52,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:19:52,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:19:52,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:19:52,697 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:19:52,697 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:19:52,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:19:52,698 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:19:52,699 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:19:52,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:19:52,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:19:52,699 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:19:52,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:19:52,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:19:52,699 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:19:52,700 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:19:52,700 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e [2018-11-28 13:19:52,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:19:52,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:19:52,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:19:52,736 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:19:52,736 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:19:52,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-28 13:19:52,775 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/data/2f00e5fb7/bce72df71ca14c06a152faa2d5df4b97/FLAG87b9b66f9 [2018-11-28 13:19:53,137 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:19:53,137 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-28 13:19:53,143 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/data/2f00e5fb7/bce72df71ca14c06a152faa2d5df4b97/FLAG87b9b66f9 [2018-11-28 13:19:53,538 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/data/2f00e5fb7/bce72df71ca14c06a152faa2d5df4b97 [2018-11-28 13:19:53,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:19:53,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:19:53,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:19:53,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:19:53,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:19:53,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a34a792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53, skipping insertion in model container [2018-11-28 13:19:53,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:19:53,580 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:19:53,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:19:53,787 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:19:53,862 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:19:53,895 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:19:53,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53 WrapperNode [2018-11-28 13:19:53,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:19:53,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:19:53,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:19:53,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:19:53,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:19:53,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:19:53,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:19:53,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:19:53,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... [2018-11-28 13:19:53,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:19:53,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:19:53,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:19:53,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:19:53,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2565630e-98f3-4644-94b3-7df71911d1bf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:19:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:19:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:19:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:19:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:19:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:19:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:19:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:19:53,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:19:54,192 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:19:54,192 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:19:54,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:54 BoogieIcfgContainer [2018-11-28 13:19:54,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:19:54,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:19:54,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:19:54,197 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:19:54,197 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:19:54,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:19:53" (1/3) ... [2018-11-28 13:19:54,198 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@571c5215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:19:54, skipping insertion in model container [2018-11-28 13:19:54,198 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:19:54,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:53" (2/3) ... [2018-11-28 13:19:54,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@571c5215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:19:54, skipping insertion in model container [2018-11-28 13:19:54,199 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:19:54,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:54" (3/3) ... [2018-11-28 13:19:54,200 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-termination.c.i [2018-11-28 13:19:54,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:19:54,241 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:19:54,241 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:19:54,241 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:19:54,241 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:19:54,241 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:19:54,241 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:19:54,242 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:19:54,242 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:19:54,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:19:54,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:19:54,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:19:54,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:19:54,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:19:54,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:19:54,274 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:19:54,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:19:54,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:19:54,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:19:54,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:19:54,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:19:54,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:19:54,284 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 19#L571-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc(8);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 15#L550true assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + cstpncpy_~n % 4294967296, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 16#L554-4true [2018-11-28 13:19:54,284 INFO L796 eck$LassoCheckResult]: Loop: 16#L554-4true cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 7#L555true assume !(0 == cstpncpy_#t~mem7);havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset; 10#L554-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 13#L554-2true assume !!(0 != cstpncpy_#t~pre4 % 4294967296);havoc cstpncpy_#t~pre4; 16#L554-4true [2018-11-28 13:19:54,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-28 13:19:54,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:54,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:54,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-11-28 13:19:54,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:54,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:54,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-11-28 13:19:54,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:55,355 WARN L180 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 148 [2018-11-28 13:19:55,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:19:55,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:19:55,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:55,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:55,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:19:55,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:19:55,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:19:55,945 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:270, output treesize:257 [2018-11-28 13:19:56,116 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-28 13:19:56,127 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:19:56,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:19:56,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:19:56,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:19:56,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:19:56,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:19:56,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:19:56,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:19:56,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 13:19:56,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:19:56,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:19:56,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 13:19:56,442 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-11-28 13:19:56,558 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-11-28 13:19:56,558 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 13:19:56,559 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 13:19:56,561 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 13:19:56,563 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 13:19:56,564 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 13:19:56,565 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 13:19:56,566 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 13:19:56,567 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 13:19:56,569 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 13:19:56,571 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 13:19:56,572 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 13:19:56,573 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 13:19:56,574 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 13:19:56,575 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 13:19:56,575 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 13:19:56,576 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 13:19:56,578 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 13:19:56,578 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 13:19:56,580 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 13:19:56,581 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 13:19:56,582 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 13:19:56,583 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 13:19:56,584 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 13:19:56,585 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 13:19:56,586 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 13:19:56,587 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 13:19:56,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 13:19:56,822 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-28 13:19:57,105 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:19:57,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:19:57,110 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 13:19:57,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:19:57,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:19:57,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:19:57,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:19:57,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:19:57,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:19:57,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:19:57,119 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 13:19:57,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:19:57,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:19:57,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:19:57,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:19:57,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:19:57,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:19:57,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:19:57,124 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 13:19:57,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:19:57,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:19:57,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:19:57,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:19:57,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:19:57,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:19:57,206 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:19:57,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:19:57,232 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:19:57,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:19:57,235 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:19:57,236 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:19:57,236 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1, ULTIMATE.start_cstpncpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 - 1*ULTIMATE.start_cstpncpy_~s~0.offset Supporting invariants [] [2018-11-28 13:19:57,304 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-11-28 13:19:57,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:19:57,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:57,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:57,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:57,413 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 13:19:57,423 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 13:19:57,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-28 13:19:57,485 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 7 states. [2018-11-28 13:19:57,486 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 13:19:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:19:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 13:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 13:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 13:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 13:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:19:57,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-28 13:19:57,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:19:57,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 14 states and 17 transitions. [2018-11-28 13:19:57,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:19:57,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:19:57,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 13:19:57,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:19:57,497 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 13:19:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 13:19:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 13:19:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:19:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 13:19:57,515 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:19:57,515 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:19:57,515 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:19:57,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 13:19:57,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:19:57,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:19:57,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:19:57,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:57,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:19:57,516 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 193#L568 assume !(main_~length~0 < 1); 198#L568-2 assume !(main_~n~0 < 1); 201#L571-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc(8);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 204#L550 assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + cstpncpy_~n % 4294967296, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 202#L554-4 cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 203#L555 assume 0 == cstpncpy_#t~mem7;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset;call write~$Pointer$(cstpncpy_~d~0.base, cstpncpy_~d~0.offset - 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); 200#L557-3 [2018-11-28 13:19:57,516 INFO L796 eck$LassoCheckResult]: Loop: 200#L557-3 cstpncpy_#t~pre8 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 199#L557-1 assume !!(0 != cstpncpy_#t~pre8 % 4294967296);havoc cstpncpy_#t~pre8;cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post9.base, 1 + cstpncpy_#t~post9.offset;call write~int(0, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, 1);havoc cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset; 200#L557-3 [2018-11-28 13:19:57,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-11-28 13:19:57,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:57,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-28 13:19:57,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:57,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:57,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-11-28 13:19:57,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:57,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:57,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:20:01,010 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 230 DAG size of output: 211 [2018-11-28 13:20:01,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:01,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:01,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:01,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:02,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:02,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:03,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:03,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:04,709 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:04,748 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:05,472 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:05,485 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:06,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:06,189 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:399, output treesize:673 [2018-11-28 13:20:06,864 WARN L180 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-11-28 13:20:06,866 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:20:06,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:20:06,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:20:06,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:20:06,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:20:06,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:20:06,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:20:06,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:20:06,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 13:20:06,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:20:06,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:20:06,871 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 13:20:06,894 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 13:20:06,902 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 13:20:06,903 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 13:20:06,914 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 13:20:06,915 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 13:20:06,916 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 13:20:06,917 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 13:20:06,918 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 13:20:06,920 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 13:20:06,921 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 13:20:06,922 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 13:20:06,923 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 13:20:06,924 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 13:20:06,925 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 13:20:06,926 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 13:20:06,927 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 13:20:06,927 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 13:20:06,930 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 13:20:06,931 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 13:20:07,438 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2018-11-28 13:20:07,528 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 13:20:07,529 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 13:20:07,530 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 13:20:07,530 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 13:20:07,531 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 13:20:07,533 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 13:20:07,534 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 13:20:07,535 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 13:20:07,536 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 13:20:07,744 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-28 13:20:08,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:20:08,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:20:08,073 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 13:20:08,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,077 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 13:20:08,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,078 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 13:20:08,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,080 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 13:20:08,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,087 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 13:20:08,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,090 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 13:20:08,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,091 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 13:20:08,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,093 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 13:20:08,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,095 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 13:20:08,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,098 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 13:20:08,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,101 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 13:20:08,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,102 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 13:20:08,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,104 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 13:20:08,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,106 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 13:20:08,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,109 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 13:20:08,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,111 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 13:20:08,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,112 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 13:20:08,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:20:08,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,122 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 13:20:08,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,125 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 13:20:08,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:20:08,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,128 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:20:08,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,129 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:20:08,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,131 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 13:20:08,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,135 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 13:20:08,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:20:08,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,141 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 13:20:08,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,143 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 13:20:08,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,145 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 13:20:08,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:20:08,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,149 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 13:20:08,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,156 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 13:20:08,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,158 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 13:20:08,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,161 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 13:20:08,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,164 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 13:20:08,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:20:08,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:20:08,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:20:08,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:20:08,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:20:08,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:20:08,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:20:08,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:20:08,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:20:08,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:20:08,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:20:08,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:20:08,228 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 13:20:08,228 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:20:08,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:20:08,229 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:20:08,229 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:20:08,229 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_2) = -1*ULTIMATE.start_cstpncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_2 Supporting invariants [] [2018-11-28 13:20:08,297 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2018-11-28 13:20:08,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:20:08,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:08,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:20:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:08,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:20:08,328 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 13:20:08,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 13:20:08,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:20:08,335 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 19 transitions. Complement of second has 4 states. [2018-11-28 13:20:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:20:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:20:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-28 13:20:08,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 13:20:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:20:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 13:20:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:20:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 13:20:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:20:08,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 13:20:08,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:20:08,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 13:20:08,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:20:08,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:20:08,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:20:08,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:20:08,338 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:20:08,338 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:20:08,338 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:20:08,338 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:20:08,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:20:08,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:20:08,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:20:08,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:20:08 BoogieIcfgContainer [2018-11-28 13:20:08,345 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:20:08,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:20:08,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:20:08,345 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:20:08,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:54" (3/4) ... [2018-11-28 13:20:08,348 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:20:08,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:20:08,349 INFO L168 Benchmark]: Toolchain (without parser) took 14807.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 949.6 MB in the beginning and 884.3 MB in the end (delta: 65.3 MB). Peak memory consumption was 256.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:08,349 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:08,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:08,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:08,352 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:08,352 INFO L168 Benchmark]: RCFGBuilder took 241.25 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 13:20:08,352 INFO L168 Benchmark]: BuchiAutomizer took 14151.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 219.7 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:08,353 INFO L168 Benchmark]: Witness Printer took 3.07 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:08,356 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.25 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 14151.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 219.7 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.07 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 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 -1 * d + unknown-#length-unknown[d] and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 13.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 32 SDslu, 14 SDs, 0 SdLazy, 15 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital560 mio100 ax103 hnf99 lsp95 ukn49 mio100 lsp48 div167 bol100 ite100 ukn100 eq174 hnf70 smp92 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...