./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-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_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/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 51c86dc5019658537c4cb35ed62637baeb91c588 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:06,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:06,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:06,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:06,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:06,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:06,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:06,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:06,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:06,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:06,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:06,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:06,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:06,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:06,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:06,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:06,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:06,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:06,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:06,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:06,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:06,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:06,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:06,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:06,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:06,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:06,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:06,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:06,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:06,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:06,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:06,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:06,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:06,890 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:06,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:06,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:06,892 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:06,903 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:06,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:06,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:06,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:06,904 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:06,905 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:06,905 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:06,905 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:06,905 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:06,905 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:06,905 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:06,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:06,906 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:06,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:06,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:06,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:06,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:06,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:06,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:06,907 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:06,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:06,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:06,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:06,908 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:06,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:06,908 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:06,908 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:06,909 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:06,909 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_b920cd22-b3c5-43e0-92f7-95c061444912/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 -> 51c86dc5019658537c4cb35ed62637baeb91c588 [2018-10-27 06:11:06,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:06,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:06,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:06,951 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:06,951 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:06,952 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-10-27 06:11:06,995 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/data/26c20aebe/7422141a45fa4907a20fa409aa90fe8e/FLAG7ac36890d [2018-10-27 06:11:07,413 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:07,414 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-10-27 06:11:07,424 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/data/26c20aebe/7422141a45fa4907a20fa409aa90fe8e/FLAG7ac36890d [2018-10-27 06:11:07,436 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/bin-2019/uautomizer/data/26c20aebe/7422141a45fa4907a20fa409aa90fe8e [2018-10-27 06:11:07,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:07,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:07,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:07,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:07,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:07,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bc4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07, skipping insertion in model container [2018-10-27 06:11:07,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:07,492 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:07,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:07,737 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:07,774 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:07,821 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:07,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07 WrapperNode [2018-10-27 06:11:07,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:07,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:07,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:07,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:07,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:07,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:07,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:07,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:07,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... [2018-10-27 06:11:07,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:07,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:07,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:07,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:07,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b920cd22-b3c5-43e0-92f7-95c061444912/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-10-27 06:11:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:08,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:08,439 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:08,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:08 BoogieIcfgContainer [2018-10-27 06:11:08,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:08,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:08,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:08,444 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:08,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:08,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:07" (1/3) ... [2018-10-27 06:11:08,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71055ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:08, skipping insertion in model container [2018-10-27 06:11:08,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:08,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:07" (2/3) ... [2018-10-27 06:11:08,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71055ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:08, skipping insertion in model container [2018-10-27 06:11:08,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:08,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:08" (3/3) ... [2018-10-27 06:11:08,450 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-termination.c.i [2018-10-27 06:11:08,503 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:08,503 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:08,504 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:08,504 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:08,504 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:08,504 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:08,504 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:08,504 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:08,504 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:08,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-10-27 06:11:08,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:11:08,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:08,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:08,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:08,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:08,545 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:08,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-10-27 06:11:08,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:11:08,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:08,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:08,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:08,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:08,556 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 5#L566true assume !(main_~length~0 < 1); 11#L566-2true assume !(main_~n~0 < 1); 3#L569-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 14#L574true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L574 18#L574-1true assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 23#L550true assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 25#L553-4true [2018-10-27 06:11:08,556 INFO L795 eck$LassoCheckResult]: Loop: 25#L553-4true assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 8#L554true SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L554 12#L554-1true SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L554-1 16#L554-2true assume !(cstrncpy_#t~mem5 == 0);havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 17#L553-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 20#L553-2true assume !!(cstrncpy_#t~pre2 % 4294967296 != 0);havoc cstrncpy_#t~pre2; 25#L553-4true [2018-10-27 06:11:08,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 180425517, now seen corresponding path program 1 times [2018-10-27 06:11:08,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1598512636, now seen corresponding path program 1 times [2018-10-27 06:11:08,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1019191256, now seen corresponding path program 1 times [2018-10-27 06:11:08,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:09,078 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:11:09,241 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:11:09,914 WARN L179 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-10-27 06:11:10,173 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 06:11:10,182 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:10,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:10,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:10,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:10,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:10,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:10,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:10,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:10,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:11:10,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:10,185 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:10,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,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-10-27 06:11:10,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:10,882 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-10-27 06:11:11,046 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-10-27 06:11:11,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,337 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-27 06:11:11,438 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-27 06:11:11,711 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-10-27 06:11:11,879 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:11,884 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:11,886 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-10-27 06:11:11,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,894 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-10-27 06:11:11,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,897 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-10-27 06:11:11,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,899 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-10-27 06:11:11,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,901 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-10-27 06:11:11,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,904 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-10-27 06:11:11,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,906 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-10-27 06:11:11,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:11,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:11,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:11,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,925 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-10-27 06:11:11,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:11,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,933 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-10-27 06:11:11,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,936 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-10-27 06:11:11,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,938 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-10-27 06:11:11,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,941 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-10-27 06:11:11,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,954 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-10-27 06:11:11,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,967 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-10-27 06:11:11,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,983 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-10-27 06:11:11,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,991 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-10-27 06:11:11,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:11,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:11,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:11,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,993 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-10-27 06:11:11,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:11,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:11,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:11,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:11,998 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-10-27 06:11:11,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:11,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:11,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:11,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:12,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:12,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:12,145 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:12,210 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:12,211 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:11:12,213 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:12,214 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:12,215 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:12,216 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-10-27 06:11:12,491 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-10-27 06:11:12,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:12,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:12,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:12,773 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-10-27 06:11:12,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 6 states. [2018-10-27 06:11:12,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 6 states. Result 49 states and 58 transitions. Complement of second has 10 states. [2018-10-27 06:11:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-10-27 06:11:12,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 6 letters. [2018-10-27 06:11:12,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 14 letters. Loop has 6 letters. [2018-10-27 06:11:12,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 12 letters. [2018-10-27 06:11:12,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:12,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2018-10-27 06:11:12,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:12,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 21 states and 24 transitions. [2018-10-27 06:11:12,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:12,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:11:12,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-10-27 06:11:12,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:12,962 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-10-27 06:11:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-10-27 06:11:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-27 06:11:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:11:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-10-27 06:11:12,985 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:11:12,985 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:11:12,985 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:12,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-10-27 06:11:12,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:12,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:12,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:12,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:12,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:12,987 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 212#L566 assume !(main_~length~0 < 1); 213#L566-2 assume !(main_~n~0 < 1); 208#L569-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 209#L574 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L574 221#L574-1 assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 225#L550 assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 227#L553-4 assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 215#L554 SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L554 216#L554-1 SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L554-1 220#L554-2 assume cstrncpy_#t~mem5 == 0;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 214#L555-4 [2018-10-27 06:11:12,987 INFO L795 eck$LassoCheckResult]: Loop: 214#L555-4 assume true; 217#L555-1 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 218#L555-2 assume !!(cstrncpy_#t~pre6 % 4294967296 != 0);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset + 1; 210#L556 SUMMARY for call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1); srcloc: L556 211#L556-1 havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 214#L555-4 [2018-10-27 06:11:12,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -796590415, now seen corresponding path program 1 times [2018-10-27 06:11:12,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 60187782, now seen corresponding path program 1 times [2018-10-27 06:11:13,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2133519402, now seen corresponding path program 1 times [2018-10-27 06:11:13,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:13,385 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-27 06:11:13,582 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:11:13,896 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 128 [2018-10-27 06:11:14,011 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-27 06:11:14,013 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:14,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:14,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:14,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:14,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:14,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:14,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:14,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:14,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:11:14,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:14,014 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:14,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:14,449 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-10-27 06:11:14,582 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-10-27 06:11:14,948 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-10-27 06:11:15,088 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-27 06:11:15,444 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:15,444 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:15,445 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-10-27 06:11:15,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,448 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-10-27 06:11:15,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,456 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-10-27 06:11:15,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,462 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-10-27 06:11:15,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,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-10-27 06:11:15,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,474 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-10-27 06:11:15,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,476 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-10-27 06:11:15,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,478 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-10-27 06:11:15,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,480 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-10-27 06:11:15,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,492 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-10-27 06:11:15,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,500 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-10-27 06:11:15,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,504 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-10-27 06:11:15,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,510 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-10-27 06:11:15,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,512 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-10-27 06:11:15,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,520 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-10-27 06:11:15,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,522 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-10-27 06:11:15,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,556 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-10-27 06:11:15,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:15,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:15,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:15,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:15,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,573 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-10-27 06:11:15,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:15,587 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-10-27 06:11:15,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:15,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:15,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:15,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:15,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:15,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:15,641 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:15,661 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:15,661 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:15,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:15,663 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:15,663 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:15,664 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2 Supporting invariants [] [2018-10-27 06:11:15,807 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:11:15,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:15,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:16,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:11:16,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-10-27 06:11:16,053 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2018-10-27 06:11:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-10-27 06:11:16,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:11:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:11:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:11:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:16,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-10-27 06:11:16,057 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:16,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:16,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:16,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:16,058 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:16,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:16,058 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:16,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:16,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:16 BoogieIcfgContainer [2018-10-27 06:11:16,066 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:16,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:16,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:16,066 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:16,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:08" (3/4) ... [2018-10-27 06:11:16,070 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:16,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:16,071 INFO L168 Benchmark]: Toolchain (without parser) took 8631.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -247.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:16,072 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:16,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.34 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:16,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -216.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:16,076 INFO L168 Benchmark]: Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:16,077 INFO L168 Benchmark]: RCFGBuilder took 490.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:16,079 INFO L168 Benchmark]: BuchiAutomizer took 7626.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:16,080 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:16,082 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.34 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -216.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 490.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7626.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 7 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[d] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 51 SDslu, 38 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf99 lsp91 ukn105 mio100 lsp52 div159 bol100 ite100 ukn100 eq178 hnf71 smp92 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...