./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/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_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/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-635dfa2 [2018-12-08 09:56:39,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:56:39,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:56:39,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:56:39,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:56:39,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:56:39,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:56:39,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:56:39,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:56:39,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:56:39,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:56:39,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:56:39,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:56:39,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:56:39,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:56:39,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:56:39,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:56:39,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:56:39,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:56:39,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:56:39,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:56:39,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:56:39,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:56:39,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:56:39,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:56:39,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:56:39,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:56:39,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:56:39,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:56:39,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:56:39,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:56:39,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:56:39,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:56:39,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:56:39,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:56:39,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:56:39,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:56:39,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:56:39,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:56:39,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:56:39,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:56:39,825 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:56:39,825 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:56:39,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:56:39,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:56:39,827 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:56:39,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:56:39,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:56:39,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:56:39,828 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:56:39,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:56:39,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:56:39,828 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:56:39,829 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:56:39,829 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_6bdb49df-9bf3-47fc-b45d-79991c1ba754/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-12-08 09:56:39,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:56:39,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:56:39,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:56:39,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:56:39,855 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:56:39,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-12-08 09:56:39,891 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/data/a997497a9/87239a5057aa4bd3ab3788b648fe8cbd/FLAGab224090c [2018-12-08 09:56:40,347 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:56:40,348 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca_true-termination.c.i [2018-12-08 09:56:40,354 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/data/a997497a9/87239a5057aa4bd3ab3788b648fe8cbd/FLAGab224090c [2018-12-08 09:56:40,362 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/bin-2019/uautomizer/data/a997497a9/87239a5057aa4bd3ab3788b648fe8cbd [2018-12-08 09:56:40,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:56:40,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:56:40,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:56:40,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:56:40,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:56:40,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f79a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40, skipping insertion in model container [2018-12-08 09:56:40,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:56:40,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:56:40,557 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:56:40,596 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:56:40,620 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:56:40,647 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:56:40,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40 WrapperNode [2018-12-08 09:56:40,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:56:40,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:56:40,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:56:40,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:56:40,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:56:40,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:56:40,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:56:40,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:56:40,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... [2018-12-08 09:56:40,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:56:40,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:56:40,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:56:40,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:56:40,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bdb49df-9bf3-47fc-b45d-79991c1ba754/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-12-08 09:56:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:56:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:56:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:56:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 09:56:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 09:56:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:56:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:56:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:56:40,874 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:56:40,875 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:56:40,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:56:40 BoogieIcfgContainer [2018-12-08 09:56:40,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:56:40,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:56:40,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:56:40,877 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:56:40,878 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:56:40,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:56:40" (1/3) ... [2018-12-08 09:56:40,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36284e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:56:40, skipping insertion in model container [2018-12-08 09:56:40,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:56:40,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:56:40" (2/3) ... [2018-12-08 09:56:40,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36284e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:56:40, skipping insertion in model container [2018-12-08 09:56:40,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:56:40,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:56:40" (3/3) ... [2018-12-08 09:56:40,880 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-termination.c.i [2018-12-08 09:56:40,911 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:56:40,912 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:56:40,912 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:56:40,912 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:56:40,912 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:56:40,912 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:56:40,912 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:56:40,912 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:56:40,912 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:56:40,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 09:56:40,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 09:56:40,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:56:40,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:56:40,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:56:40,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:56:40,937 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:56:40,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 09:56:40,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 09:56:40,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:56:40,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:56:40,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:56:40,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:56:40,943 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-12-08 09:56:40,943 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~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7; 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-12-08 09:56:40,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-08 09:56:40,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:40,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-12-08 09:56:41,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:41,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-12-08 09:56:41,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:41,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:41,830 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 148 [2018-12-08 09:56:41,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:41,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:42,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:56:42,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:56:42,254 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:42,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:42,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:42,410 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:270, output treesize:257 [2018-12-08 09:56:42,571 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-08 09:56:42,581 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:56:42,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:56:42,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:56:42,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:56:42,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:56:42,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:56:42,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:56:42,583 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:56:42,583 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 09:56:42,583 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:56:42,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:56:42,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,884 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-12-08 09:56:42,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:42,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:43,135 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-08 09:56:43,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:56:43,527 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:56:43,528 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-12-08 09:56:43,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:43,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:43,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:43,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:43,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:43,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:43,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:43,536 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-12-08 09:56:43,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:43,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:43,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:43,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:43,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:43,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:43,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:43,542 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-12-08 09:56:43,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:43,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:43,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:43,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:43,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:43,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:43,622 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:56:43,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:56:43,648 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:56:43,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:56:43,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:56:43,651 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:56:43,651 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1) = -1*ULTIMATE.start_cstpncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 Supporting invariants [] [2018-12-08 09:56:43,717 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-12-08 09:56:43,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 09:56:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:56:43,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:56:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:56:43,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:56:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:56:43,804 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-12-08 09:56:43,804 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-12-08 09:56:43,861 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-12-08 09:56:43,861 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-12-08 09:56:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:56:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-08 09:56:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-08 09:56:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-08 09:56:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-08 09:56:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:43,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-08 09:56:43,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:56:43,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 14 states and 17 transitions. [2018-12-08 09:56:43,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:56:43,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 09:56:43,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-08 09:56:43,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:56:43,871 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-08 09:56:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-08 09:56:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-08 09:56:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 09:56:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-08 09:56:43,887 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 09:56:43,887 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 09:56:43,887 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:56:43,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-08 09:56:43,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:56:43,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:56:43,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:56:43,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:56:43,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:56:43,888 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~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~mem7;call write~$Pointer$(cstpncpy_~d~0.base, cstpncpy_~d~0.offset - 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8); 200#L557-3 [2018-12-08 09:56:43,888 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-12-08 09:56:43,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-12-08 09:56:43,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:43,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:43,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-12-08 09:56:43,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:43,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:43,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-12-08 09:56:43,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:56:43,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:56:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:56:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:56:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:56:46,976 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 230 DAG size of output: 211 [2018-12-08 09:56:46,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:47,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:47,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:47,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:48,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:48,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:49,417 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 09:56:49,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:56:50,268 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:50,283 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:51,013 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:51,023 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:51,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 09:56:51,661 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:399, output treesize:673 [2018-12-08 09:56:52,344 WARN L180 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-08 09:56:52,347 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:56:52,347 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:56:52,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:56:52,347 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:56:52,347 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:56:52,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:56:52,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:56:52,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:56:52,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 09:56:52,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:56:52,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:56:52,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,903 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2018-12-08 09:56:52,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:52,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:56:53,194 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-12-08 09:56:53,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:56:53,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:56:53,521 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-12-08 09:56:53,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,523 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-12-08 09:56:53,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,524 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-12-08 09:56:53,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,525 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-12-08 09:56:53,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,527 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-12-08 09:56:53,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,528 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-12-08 09:56:53,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,529 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-12-08 09:56:53,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,530 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-12-08 09:56:53,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,531 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-12-08 09:56:53,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,533 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-12-08 09:56:53,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,535 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-12-08 09:56:53,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,536 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-12-08 09:56:53,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,537 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-12-08 09:56:53,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,538 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-12-08 09:56:53,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,540 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-12-08 09:56:53,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,541 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-12-08 09:56:53,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,542 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-12-08 09:56:53,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,543 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-12-08 09:56:53,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,544 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-12-08 09:56:53,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,546 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-12-08 09:56:53,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,548 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-12-08 09:56:53,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,551 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-12-08 09:56:53,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:56:53,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:56:53,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,553 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-12-08 09:56:53,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,555 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-12-08 09:56:53,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,557 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-12-08 09:56:53,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,558 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-12-08 09:56:53,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,559 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-12-08 09:56:53,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,560 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-12-08 09:56:53,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,561 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-12-08 09:56:53,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,564 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-12-08 09:56:53,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,566 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-12-08 09:56:53,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,567 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-12-08 09:56:53,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,569 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-12-08 09:56:53,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:56:53,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:56:53,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:56:53,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:56:53,570 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-12-08 09:56:53,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:56:53,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:56:53,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:56:53,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:56:53,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:56:53,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:56:53,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:56:53,612 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 09:56:53,612 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 09:56:53,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:56:53,613 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:56:53,613 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:56:53,613 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-12-08 09:56:53,667 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2018-12-08 09:56:53,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 09:56:53,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:56:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:56:53,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:56:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:56:53,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:56:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:56:53,693 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-12-08 09:56:53,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 09:56:53,698 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-12-08 09:56:53,698 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-12-08 09:56:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:56:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-08 09:56:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 09:56:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 09:56:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-08 09:56:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:56:53,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-08 09:56:53,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:56:53,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:56:53,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:56:53,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:56:53,700 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:56:53,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:56:53,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:56:53,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:56:53,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:56:53 BoogieIcfgContainer [2018-12-08 09:56:53,704 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:56:53,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:56:53,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:56:53,704 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:56:53,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:56:40" (3/4) ... [2018-12-08 09:56:53,707 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:56:53,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:56:53,707 INFO L168 Benchmark]: Toolchain (without parser) took 13343.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 949.6 MB in the beginning and 882.3 MB in the end (delta: 67.2 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:56:53,708 INFO L168 Benchmark]: CDTParser took 0.11 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-12-08 09:56:53,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:56:53,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.06 ms. Allocated memory is still 1.1 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-12-08 09:56:53,709 INFO L168 Benchmark]: Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.1 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-12-08 09:56:53,709 INFO L168 Benchmark]: RCFGBuilder took 185.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:56:53,709 INFO L168 Benchmark]: BuchiAutomizer took 12828.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 882.3 MB in the end (delta: 197.9 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:56:53,710 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory was 882.3 MB in the beginning and 882.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-08 09:56:53,712 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.11 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 282.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.06 ms. Allocated memory is still 1.1 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 16.50 ms. Allocated memory is still 1.1 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 185.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12828.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 882.3 MB in the end (delta: 197.9 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.2 GB. Free memory was 882.3 MB in the beginning and 882.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] 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 12.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 12.5s. 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: 2ms 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...