./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-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_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/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 20d74f4d70a20b55179c45eafbef37cbb7fed804 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:07:39,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:07:39,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:07:39,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:07:39,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:07:39,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:07:39,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:07:39,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:07:39,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:07:39,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:07:39,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:07:39,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:07:39,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:07:39,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:07:39,563 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:07:39,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:07:39,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:07:39,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:07:39,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:07:39,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:07:39,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:07:39,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:07:39,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:07:39,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:07:39,571 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:07:39,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:07:39,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:07:39,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:07:39,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:07:39,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:07:39,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:07:39,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:07:39,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:07:39,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:07:39,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:07:39,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:07:39,577 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:07:39,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:07:39,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:07:39,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:07:39,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:07:39,589 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:07:39,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:07:39,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:07:39,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:07:39,591 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:07:39,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:07:39,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:07:39,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:07:39,591 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:07:39,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:07:39,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:07:39,592 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:07:39,592 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:07:39,592 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_51b63d28-2e4d-44a3-9ac7-163073efac24/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 -> 20d74f4d70a20b55179c45eafbef37cbb7fed804 [2018-11-10 05:07:39,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:07:39,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:07:39,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:07:39,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:07:39,629 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:07:39,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-10 05:07:39,678 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/data/9bd29be01/0bdcd147d4b247668158a63b7dd67733/FLAG883570d78 [2018-11-10 05:07:40,118 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:07:40,118 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-10 05:07:40,128 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/data/9bd29be01/0bdcd147d4b247668158a63b7dd67733/FLAG883570d78 [2018-11-10 05:07:40,137 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/data/9bd29be01/0bdcd147d4b247668158a63b7dd67733 [2018-11-10 05:07:40,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:07:40,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:07:40,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:07:40,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:07:40,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:07:40,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786178a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40, skipping insertion in model container [2018-11-10 05:07:40,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:07:40,177 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:07:40,354 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:07:40,361 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:07:40,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:07:40,412 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:07:40,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40 WrapperNode [2018-11-10 05:07:40,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:07:40,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:07:40,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:07:40,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:07:40,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:07:40,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:07:40,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:07:40,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:07:40,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... [2018-11-10 05:07:40,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:07:40,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:07:40,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:07:40,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:07:40,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b63d28-2e4d-44a3-9ac7-163073efac24/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:07:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:07:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:07:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:07:40,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:07:40,722 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:07:40,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:07:40 BoogieIcfgContainer [2018-11-10 05:07:40,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:07:40,723 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:07:40,723 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:07:40,726 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:07:40,726 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:07:40,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:07:40" (1/3) ... [2018-11-10 05:07:40,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@755bc3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:07:40, skipping insertion in model container [2018-11-10 05:07:40,728 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:07:40,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:07:40" (2/3) ... [2018-11-10 05:07:40,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@755bc3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:07:40, skipping insertion in model container [2018-11-10 05:07:40,728 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:07:40,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:07:40" (3/3) ... [2018-11-10 05:07:40,730 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-10 05:07:40,778 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:07:40,779 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:07:40,779 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:07:40,779 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:07:40,779 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:07:40,780 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:07:40,780 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:07:40,780 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:07:40,780 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:07:40,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 05:07:40,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:07:40,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:07:40,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:07:40,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:07:40,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:07:40,817 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:07:40,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 05:07:40,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:07:40,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:07:40,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:07:40,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:07:40,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:07:40,826 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~n~0 < 1); 18#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 9#L565true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 12#L565-1true assume { :begin_inline_cstrnlen } true;cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 10#L551-8true [2018-11-10 05:07:40,826 INFO L795 eck$LassoCheckResult]: Loop: 10#L551-8true assume true;cstrnlen_#t~short5 := cstrnlen_~maxlen % 4294967296 != 0; 17#L551-1true assume !cstrnlen_#t~short5; 5#L551-5true assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; 8#L551-7true cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset + 1;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 10#L551-8true [2018-11-10 05:07:40,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-11-10 05:07:40,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:07:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:07:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:07:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:40,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1577130, now seen corresponding path program 1 times [2018-11-10 05:07:40,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:07:40,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:07:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:07:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:07:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:07:40,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:07:40,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:07:40,983 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:07:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:07:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:07:40,994 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-10 05:07:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:07:41,018 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-10 05:07:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:07:41,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-10 05:07:41,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:07:41,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 15 transitions. [2018-11-10 05:07:41,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 05:07:41,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 05:07:41,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-10 05:07:41,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:07:41,026 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-10 05:07:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-10 05:07:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 05:07:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 05:07:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-10 05:07:41,052 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-10 05:07:41,052 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-10 05:07:41,052 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:07:41,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-10 05:07:41,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 05:07:41,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:07:41,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:07:41,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:07:41,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:07:41,054 INFO L793 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 56#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 48#L558 assume !(main_~length1~0 < 1); 49#L558-2 assume !(main_~n~0 < 1); 51#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 53#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 54#L565-1 assume { :begin_inline_cstrnlen } true;cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 52#L551-8 [2018-11-10 05:07:41,055 INFO L795 eck$LassoCheckResult]: Loop: 52#L551-8 assume true;cstrnlen_#t~short5 := cstrnlen_~maxlen % 4294967296 != 0; 55#L551-1 assume cstrnlen_#t~short5; 58#L551-2 SUMMARY for call cstrnlen_#t~mem4 := read~int(cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset, 1); srcloc: L551-2 46#L551-3 cstrnlen_#t~short5 := cstrnlen_#t~mem4 != 0; 47#L551-5 assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; 50#L551-7 cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset + 1;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 52#L551-8 [2018-11-10 05:07:41,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 2 times [2018-11-10 05:07:41,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:07:41,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:07:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:07:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1511651207, now seen corresponding path program 1 times [2018-11-10 05:07:41,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:07:41,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:07:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:07:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1104130253, now seen corresponding path program 1 times [2018-11-10 05:07:41,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:07:41,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:07:41,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:07:41,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:07:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:07:41,371 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-10 05:07:41,427 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:07:41,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:07:41,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:07:41,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:07:41,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:07:41,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:07:41,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:07:41,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:07:41,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrnlen-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 05:07:41,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:07:41,429 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:07:41,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,621 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-10 05:07:41,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:41,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:07:42,027 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:07:42,031 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:07:42,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:07:42,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,076 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:07:42,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:07:42,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:07:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,106 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:07:42,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:07:42,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:07:42,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:07:42,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:07:42,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:07:42,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:07:42,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:07:42,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:07:42,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:07:42,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:07:42,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:07:42,182 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:07:42,182 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 05:07:42,184 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:07:42,186 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:07:42,186 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:07:42,187 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_cstrnlen_~cp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_cstrnlen_~cp~0.offset Supporting invariants [] [2018-11-10 05:07:42,209 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:07:42,214 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:07:42,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:07:42,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 05:07:42,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:07:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:07:42,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:07:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:07:42,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:07:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:07:42,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:07:42,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 05:07:42,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 19 states and 22 transitions. Complement of second has 7 states. [2018-11-10 05:07:42,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:07:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:07:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-10 05:07:42,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-10 05:07:42,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:07:42,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-10 05:07:42,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:07:42,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-10 05:07:42,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:07:42,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-10 05:07:42,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:07:42,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-10 05:07:42,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:07:42,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:07:42,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:07:42,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:07:42,332 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:07:42,333 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:07:42,333 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:07:42,333 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:07:42,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:07:42,333 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:07:42,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:07:42,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:07:42 BoogieIcfgContainer [2018-11-10 05:07:42,337 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:07:42,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:07:42,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:07:42,338 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:07:42,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:07:40" (3/4) ... [2018-11-10 05:07:42,341 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:07:42,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:07:42,341 INFO L168 Benchmark]: Toolchain (without parser) took 2201.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 956.6 MB in the beginning and 849.9 MB in the end (delta: 106.7 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:07:42,342 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:07:42,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.88 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 932.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:07:42,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:07:42,343 INFO L168 Benchmark]: Boogie Preprocessor took 15.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:07:42,343 INFO L168 Benchmark]: RCFGBuilder took 222.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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:07:42,344 INFO L168 Benchmark]: BuchiAutomizer took 1613.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 849.9 MB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:07:42,344 INFO L168 Benchmark]: Witness Printer took 3.34 ms. Allocated memory is still 1.2 GB. Free memory is still 849.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:07:42,347 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.88 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 932.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1613.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 849.9 MB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.34 ms. Allocated memory is still 1.2 GB. Free memory is still 849.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * cp and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 16 SDslu, 25 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax112 hnf98 lsp72 ukn110 mio100 lsp39 div119 bol100 ite100 ukn100 eq165 hnf88 smp100 dnf101 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...