./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/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 65f48e4185e35c19ad63746401273302b721b37d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:03:13,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:03:13,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:03:13,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:03:13,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:03:13,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:03:13,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:03:13,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:03:13,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:03:13,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:03:13,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:03:13,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:03:13,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:03:13,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:03:13,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:03:13,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:03:13,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:03:13,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:03:13,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:03:13,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:03:13,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:03:13,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:03:13,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:03:13,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:03:13,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:03:13,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:03:13,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:03:13,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:03:13,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:03:13,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:03:13,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:03:13,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:03:13,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:03:13,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:03:13,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:03:13,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:03:13,907 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:03:13,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:03:13,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:03:13,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:03:13,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:03:13,919 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:03:13,919 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:03:13,919 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:03:13,919 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:03:13,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:03:13,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:03:13,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:03:13,921 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:03:13,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:03:13,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:03:13,922 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:03:13,923 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:03:13,923 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_5dc21899-0ab6-497a-9808-06f0da3b5df6/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 -> 65f48e4185e35c19ad63746401273302b721b37d [2018-11-10 07:03:13,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:03:13,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:03:13,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:03:13,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:03:13,959 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:03:13,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i [2018-11-10 07:03:14,005 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/data/9c8d85455/9b8974b9d2424f48b2ae9e4ed4c2374e/FLAG94a1de7aa [2018-11-10 07:03:14,365 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:03:14,366 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i [2018-11-10 07:03:14,373 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/data/9c8d85455/9b8974b9d2424f48b2ae9e4ed4c2374e/FLAG94a1de7aa [2018-11-10 07:03:14,382 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/data/9c8d85455/9b8974b9d2424f48b2ae9e4ed4c2374e [2018-11-10 07:03:14,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:03:14,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:03:14,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:14,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:03:14,389 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:03:14,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e198594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14, skipping insertion in model container [2018-11-10 07:03:14,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:03:14,426 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:03:14,606 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:14,614 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:03:14,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:14,671 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:03:14,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14 WrapperNode [2018-11-10 07:03:14,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:14,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:14,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:03:14,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:03:14,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:14,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:03:14,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:03:14,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:03:14,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:03:14,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:03:14,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:03:14,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:03:14,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5dc21899-0ab6-497a-9808-06f0da3b5df6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:03:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:03:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:03:14,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:03:15,079 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:03:15,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:15 BoogieIcfgContainer [2018-11-10 07:03:15,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:03:15,080 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:03:15,080 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:03:15,082 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:03:15,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:15,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:03:14" (1/3) ... [2018-11-10 07:03:15,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@568f8704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:15, skipping insertion in model container [2018-11-10 07:03:15,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:15,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (2/3) ... [2018-11-10 07:03:15,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@568f8704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:15, skipping insertion in model container [2018-11-10 07:03:15,084 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:15,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:15" (3/3) ... [2018-11-10 07:03:15,085 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-termination.c.i [2018-11-10 07:03:15,118 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:03:15,119 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:03:15,119 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:03:15,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:03:15,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:03:15,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:03:15,119 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:03:15,119 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:03:15,119 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:03:15,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 07:03:15,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:15,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:15,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:15,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,147 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:03:15,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 07:03:15,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:15,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:15,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:15,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,156 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L562true assume !(main_~length1~0 < 1); 20#L562-2true assume !(main_~length2~0 < 1); 9#L565-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 23#L570true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 4#L570-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 19#L571true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 6#L556true [2018-11-10 07:03:15,156 INFO L795 eck$LassoCheckResult]: Loop: 6#L556true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 10#L553true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 13#L553-1true cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 22#L554-5true assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 11#L554-1true SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 14#L554-2true cstrspn_~sc~0 := cstrspn_#t~mem5; 16#L554-3true assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 7#L555true assume cstrspn_~sc~0 == cstrspn_~c~0; 6#L556true [2018-11-10 07:03:15,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 07:03:15,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 801407178, now seen corresponding path program 1 times [2018-11-10 07:03:15,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744052, now seen corresponding path program 1 times [2018-11-10 07:03:15,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,684 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 07:03:15,775 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:15,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:15,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:15,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:15,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:15,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:15,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:15,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:15,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 07:03:15,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:15,777 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:15,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,144 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-10 07:03:16,286 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 07:03:16,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:16,715 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:16,718 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:16,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,767 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:03:16,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,769 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:03:16,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,862 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:16,888 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:03:16,889 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:03:16,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:16,892 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:03:16,893 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:16,893 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrspn_~p~0.offset Supporting invariants [] [2018-11-10 07:03:16,945 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 07:03:16,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:03:16,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:03:17,073 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 07:03:17,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-11-10 07:03:17,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 5 states. Result 38 states and 42 transitions. Complement of second has 9 states. [2018-11-10 07:03:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:03:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:03:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-10 07:03:17,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 07:03:17,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 07:03:17,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 07:03:17,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2018-11-10 07:03:17,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:03:17,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 23 states and 27 transitions. [2018-11-10 07:03:17,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 07:03:17,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 07:03:17,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 07:03:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:03:17,179 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:03:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 07:03:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-10 07:03:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 07:03:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 07:03:17,202 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:03:17,202 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 07:03:17,202 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:03:17,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-10 07:03:17,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:03:17,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:17,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:17,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:17,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:03:17,204 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 214#L562 assume !(main_~length1~0 < 1); 225#L562-2 assume !(main_~length2~0 < 1); 215#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 216#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 204#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 205#L571 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 206#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 207#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 217#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 210#L554-5 [2018-11-10 07:03:17,204 INFO L795 eck$LassoCheckResult]: Loop: 210#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 218#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 219#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 223#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 209#L555 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 210#L554-5 [2018-11-10 07:03:17,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2052449962, now seen corresponding path program 1 times [2018-11-10 07:03:17,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:17,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 1 times [2018-11-10 07:03:17,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744054, now seen corresponding path program 1 times [2018-11-10 07:03:17,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,562 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2018-11-10 07:03:17,644 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:17,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:17,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:17,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:17,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:17,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:17,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:17,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:17,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:03:17,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:17,645 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:17,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:17,889 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-11-10 07:03:17,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:18,298 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:18,299 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:18,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:18,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:18,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:18,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,383 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:03:18,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,385 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:03:18,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,420 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 07:03:18,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,427 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 07:03:18,427 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 07:03:18,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,467 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:03:18,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:03:18,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:18,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:18,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:18,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:18,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:18,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:18,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:18,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:18,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:18,494 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:03:18,495 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:03:18,495 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:18,496 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:03:18,496 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:18,496 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2018-11-10 07:03:18,546 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-10 07:03:18,557 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:03:18,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:03:18,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:03:18,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:18,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:18,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:03:18,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:03:18,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 07:03:18,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-11-10 07:03:18,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:03:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:03:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 07:03:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-10 07:03:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 07:03:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-10 07:03:18,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:18,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-10 07:03:18,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:03:18,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 35 states and 41 transitions. [2018-11-10 07:03:18,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 07:03:18,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 07:03:18,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-10 07:03:18,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:03:18,743 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 07:03:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-10 07:03:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-10 07:03:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 07:03:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-10 07:03:18,746 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 07:03:18,746 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 07:03:18,746 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:03:18,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-11-10 07:03:18,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:03:18,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:18,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:18,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:18,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:03:18,747 INFO L793 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 429#L562 assume !(main_~length1~0 < 1); 442#L562-2 assume !(main_~length2~0 < 1); 430#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 431#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 418#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 419#L571 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 420#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 421#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 438#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 427#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 435#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 436#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 447#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 445#L555 assume cstrspn_~sc~0 == cstrspn_~c~0; 422#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 423#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 432#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 425#L554-5 [2018-11-10 07:03:18,747 INFO L795 eck$LassoCheckResult]: Loop: 425#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 433#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 434#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 439#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 424#L555 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 425#L554-5 [2018-11-10 07:03:18,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1722691775, now seen corresponding path program 2 times [2018-11-10 07:03:18,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:18,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:18,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 2 times [2018-11-10 07:03:18,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1021159359, now seen corresponding path program 1 times [2018-11-10 07:03:18,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:19,251 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 150 [2018-11-10 07:03:19,347 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:19,347 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:19,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:19,347 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:19,347 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:19,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:19,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:19,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:19,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 07:03:19,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:19,347 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:19,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,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-11-10 07:03:19,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-11-10 07:03:19,665 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2018-11-10 07:03:19,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:19,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:20,138 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:20,139 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:20,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:20,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:20,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:20,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:20,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:20,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:20,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:20,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:20,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:20,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:20,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:20,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:20,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:20,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:20,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:20,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:20,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:20,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:20,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:20,145 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:03:20,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:20,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:20,146 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:03:20,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:20,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:20,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:20,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:20,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:20,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:20,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:20,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:20,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:20,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:20,172 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:03:20,172 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:03:20,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:20,173 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:03:20,173 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:20,173 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2018-11-10 07:03:20,249 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-10 07:03:20,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:03:20,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:03:20,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 07:03:20,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 07:03:20,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 44 states and 51 transitions. Complement of second has 8 states. [2018-11-10 07:03:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:03:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:03:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 07:03:20,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 07:03:20,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:20,364 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:03:20,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:03:20,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 07:03:20,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 07:03:20,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 10 states. [2018-11-10 07:03:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 07:03:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:03:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-10 07:03:20,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 07:03:20,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:20,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:03:20,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:20,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:03:20,519 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 07:03:20,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 07:03:20,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2018-11-10 07:03:20,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:03:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:03:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-10 07:03:20,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 07:03:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:20,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-10 07:03:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:20,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 10 letters. [2018-11-10 07:03:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:20,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-10 07:03:20,551 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:20,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:03:20,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:03:20,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:03:20,552 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:03:20,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:03:20,552 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:20,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:03:20,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:03:20 BoogieIcfgContainer [2018-11-10 07:03:20,557 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:03:20,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:03:20,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:03:20,557 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:03:20,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:15" (3/4) ... [2018-11-10 07:03:20,559 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:03:20,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:03:20,560 INFO L168 Benchmark]: Toolchain (without parser) took 6175.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:20,561 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:03:20,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.11 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:20,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:20,562 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:03:20,562 INFO L168 Benchmark]: RCFGBuilder took 306.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:20,563 INFO L168 Benchmark]: BuchiAutomizer took 5477.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -53.0 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:20,563 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:03:20,566 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.11 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 306.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5477.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -53.0 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * spanp and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * spanp and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 91 SDtfs, 123 SDslu, 77 SDs, 0 SdLazy, 72 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax107 hnf99 lsp89 ukn102 mio100 lsp33 div100 bol100 ite100 ukn100 eq195 hnf88 smp96 dnf100 smp100 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...