./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/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 eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:58:55,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:58:55,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:58:55,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:58:55,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:58:55,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:58:55,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:58:55,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:58:55,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:58:55,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:58:55,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:58:55,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:58:55,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:58:55,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:58:55,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:58:55,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:58:55,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:58:55,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:58:55,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:58:55,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:58:55,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:58:55,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:58:55,611 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:58:55,611 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:58:55,611 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:58:55,612 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:58:55,613 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:58:55,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:58:55,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:58:55,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:58:55,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:58:55,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:58:55,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:58:55,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:58:55,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:58:55,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:58:55,617 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:58:55,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:58:55,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:58:55,629 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:58:55,629 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:58:55,629 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:58:55,629 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:58:55,629 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:58:55,629 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:58:55,629 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:58:55,630 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:58:55,630 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:58:55,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:58:55,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:58:55,631 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:58:55,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:58:55,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:58:55,632 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:58:55,633 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:58:55,633 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_3fafb1da-b598-40dd-95d6-aab675983c00/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 -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2018-11-18 09:58:55,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:58:55,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:58:55,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:58:55,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:58:55,665 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:58:55,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-18 09:58:55,701 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/data/65e929514/c72317bbbc4f49689dfbd1ecb5da668e/FLAGb91c940c8 [2018-11-18 09:58:56,037 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:58:56,037 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-11-18 09:58:56,043 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/data/65e929514/c72317bbbc4f49689dfbd1ecb5da668e/FLAGb91c940c8 [2018-11-18 09:58:56,052 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/bin-2019/uautomizer/data/65e929514/c72317bbbc4f49689dfbd1ecb5da668e [2018-11-18 09:58:56,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:58:56,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:58:56,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:58:56,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:58:56,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:58:56,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f10d5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56, skipping insertion in model container [2018-11-18 09:58:56,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:58:56,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:58:56,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:58:56,324 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:58:56,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:58:56,439 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:58:56,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56 WrapperNode [2018-11-18 09:58:56,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:58:56,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:58:56,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:58:56,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:58:56,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:58:56,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:58:56,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:58:56,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:58:56,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... [2018-11-18 09:58:56,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:58:56,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:58:56,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:58:56,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:58:56,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fafb1da-b598-40dd-95d6-aab675983c00/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-18 09:58:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:58:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:58:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:58:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:58:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:58:56,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:58:56,694 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:58:56,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:56 BoogieIcfgContainer [2018-11-18 09:58:56,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:58:56,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:58:56,695 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:58:56,697 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:58:56,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:56,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:58:56" (1/3) ... [2018-11-18 09:58:56,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e72d7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:58:56, skipping insertion in model container [2018-11-18 09:58:56,699 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:56,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:56" (2/3) ... [2018-11-18 09:58:56,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e72d7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:58:56, skipping insertion in model container [2018-11-18 09:58:56,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:56,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:56" (3/3) ... [2018-11-18 09:58:56,701 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-11-18 09:58:56,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:58:56,742 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:58:56,742 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:58:56,742 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:58:56,742 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:58:56,743 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:58:56,743 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:58:56,743 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:58:56,743 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:58:56,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 09:58:56,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:58:56,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:56,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:56,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:58:56,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:56,774 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:58:56,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 09:58:56,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:58:56,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:56,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:56,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:58:56,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:56,784 INFO L794 eck$LassoCheckResult]: Stem: 13#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~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L528true assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-4true [2018-11-18 09:58:56,784 INFO L796 eck$LassoCheckResult]: Loop: 7#L517-4true assume true;call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4#L517-1true assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 5#L517-3true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-4true [2018-11-18 09:58:56,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-18 09:58:56,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:56,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:56,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:56,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2018-11-18 09:58:56,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:56,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:56,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906826, now seen corresponding path program 1 times [2018-11-18 09:58:56,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:57,136 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-18 09:58:57,192 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:58:57,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:58:57,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:58:57,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:58:57,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:58:57,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:58:57,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:58:57,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:58:57,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-11-18 09:58:57,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:58:57,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:58:57,212 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-18 09:58:57,215 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-18 09:58:57,219 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-18 09:58:57,221 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-18 09:58:57,222 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-18 09:58:57,223 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-18 09:58:57,226 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-18 09:58:57,227 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-18 09:58:57,231 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-18 09:58:57,235 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-18 09:58:57,237 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-18 09:58:57,250 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-18 09:58:57,259 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-18 09:58:57,260 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-18 09:58:57,262 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-18 09:58:57,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-11-18 09:58:57,265 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-18 09:58:57,388 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-18 09:58:57,389 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-18 09:58:57,391 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-18 09:58:57,392 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-18 09:58:57,393 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-18 09:58:57,396 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-18 09:58:57,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:58:57,669 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:58:57,670 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-18 09:58:57,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,677 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-18 09:58:57,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,680 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-18 09:58:57,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,683 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-18 09:58:57,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,685 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-18 09:58:57,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,688 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-18 09:58:57,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:57,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:57,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,693 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-18 09:58:57,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,695 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-18 09:58:57,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,698 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-18 09:58:57,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,700 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-18 09:58:57,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:57,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:57,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,716 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-18 09:58:57,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:57,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:57,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,721 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-18 09:58:57,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,724 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-18 09:58:57,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,726 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-18 09:58:57,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,728 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-18 09:58:57,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,731 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-18 09:58:57,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:57,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,733 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-18 09:58:57,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:57,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:58:57,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:58:57,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:57,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:57,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:57,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:57,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:57,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:57,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:57,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:57,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:57,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:58:57,797 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:58:57,797 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:58:57,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:58:57,801 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:58:57,801 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:58:57,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2018-11-18 09:58:57,834 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 09:58:57,839 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:58:57,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:57,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:57,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:57,882 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-18 09:58:57,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:58:57,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-18 09:58:57,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 48 states and 60 transitions. Complement of second has 6 states. [2018-11-18 09:58:57,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 09:58:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:58:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-18 09:58:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-18 09:58:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 09:58:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 09:58:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:57,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-18 09:58:57,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:58:57,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 20 states and 23 transitions. [2018-11-18 09:58:57,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 09:58:57,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 09:58:57,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-18 09:58:57,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:57,931 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 09:58:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-18 09:58:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-18 09:58:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:58:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-18 09:58:57,947 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-18 09:58:57,948 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-18 09:58:57,948 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:58:57,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-18 09:58:57,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:57,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:57,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:57,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:58:57,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:57,949 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 140#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 129#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 130#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 137#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 138#L511-4 [2018-11-18 09:58:57,949 INFO L796 eck$LassoCheckResult]: Loop: 138#L511-4 assume true; 141#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 142#L511-2 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset; 138#L511-4 [2018-11-18 09:58:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 889569803, now seen corresponding path program 1 times [2018-11-18 09:58:57,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:57,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:57,987 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-18 09:58:57,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:58:57,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:58:57,989 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:57,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash 67594, now seen corresponding path program 1 times [2018-11-18 09:58:57,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:57,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:57,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:58:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:58:58,057 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 09:58:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:58,071 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-18 09:58:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:58:58,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-18 09:58:58,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:58,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-18 09:58:58,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 09:58:58,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 09:58:58,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-18 09:58:58,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:58,074 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 09:58:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-18 09:58:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 09:58:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:58:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-18 09:58:58,075 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 09:58:58,075 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 09:58:58,076 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:58:58,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-18 09:58:58,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:58,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:58,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:58,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:58:58,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:58,077 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 176#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 165#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 166#L517-4 assume true;call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 167#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 168#L517-5 strlen_#res := strlen_~i~0; 174#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 172#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 173#L511-4 [2018-11-18 09:58:58,077 INFO L796 eck$LassoCheckResult]: Loop: 173#L511-4 assume true; 177#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 178#L511-2 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset; 173#L511-4 [2018-11-18 09:58:58,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1270617397, now seen corresponding path program 1 times [2018-11-18 09:58:58,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash 67594, now seen corresponding path program 2 times [2018-11-18 09:58:58,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:58,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:58,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:58,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1416132182, now seen corresponding path program 1 times [2018-11-18 09:58:58,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:58,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:58,429 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 120 [2018-11-18 09:58:58,513 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:58:58,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:58:58,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:58:58,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:58:58,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:58:58,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:58:58,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:58:58,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:58:58,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-11-18 09:58:58,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:58:58,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:58:58,517 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-18 09:58:58,518 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-18 09:58:58,519 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-18 09:58:58,520 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-18 09:58:58,522 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-18 09:58:58,523 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-18 09:58:58,525 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-18 09:58:58,526 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-18 09:58:58,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,532 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-18 09:58:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:58,537 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-18 09:58:58,540 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-18 09:58:58,541 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-18 09:58:58,542 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-18 09:58:58,543 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-18 09:58:58,849 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-18 09:58:58,937 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-18 09:58:58,938 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-18 09:58:58,939 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-18 09:58:59,091 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-11-18 09:58:59,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:58:59,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:58:59,453 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-18 09:58:59,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,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-11-18 09:58:59,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,458 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-18 09:58:59,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,460 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-18 09:58:59,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,463 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-18 09:58:59,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:59,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:59,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:59,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,468 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-18 09:58:59,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:59,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:59,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,471 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-18 09:58:59,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:59,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,475 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-18 09:58:59,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,477 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-18 09:58:59,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,483 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-18 09:58:59,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,487 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-18 09:58:59,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,489 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-18 09:58:59,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,491 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-18 09:58:59,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,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-11-18 09:58:59,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:59,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:59,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,496 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-18 09:58:59,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,497 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-18 09:58:59,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,499 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-18 09:58:59,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,501 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-18 09:58:59,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,503 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-18 09:58:59,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,505 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-18 09:58:59,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:59,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:59,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,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-11-18 09:58:59,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:59,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:59,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:59,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:59,515 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-18 09:58:59,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:59,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:59,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:59,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:59,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:59,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:59,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:58:59,615 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:58:59,615 INFO L444 ModelExtractionUtils]: 62 out of 73 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-18 09:58:59,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:58:59,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:58:59,617 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:58:59,617 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1, ULTIMATE.start_memcpy_~c1~0.offset) = 1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1 - 1*ULTIMATE.start_memcpy_~c1~0.offset Supporting invariants [] [2018-11-18 09:58:59,680 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-18 09:58:59,682 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:58:59,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:59,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:59,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:59,756 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-18 09:58:59,756 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-18 09:58:59,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 09:58:59,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 21 transitions. Complement of second has 5 states. [2018-11-18 09:58:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 09:58:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:58:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 09:58:59,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 09:58:59,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:59,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 09:58:59,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:59,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 09:58:59,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:59,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-18 09:58:59,785 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:58:59,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2018-11-18 09:58:59,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:58:59,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:58:59,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:58:59,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:58:59,785 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:59,785 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:59,786 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:59,786 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:58:59,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:58:59,786 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:58:59,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:58:59,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:58:59 BoogieIcfgContainer [2018-11-18 09:58:59,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:58:59,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:58:59,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:58:59,792 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:58:59,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:56" (3/4) ... [2018-11-18 09:58:59,795 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:58:59,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:58:59,796 INFO L168 Benchmark]: Toolchain (without parser) took 3741.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 957.6 MB in the beginning and 906.1 MB in the end (delta: 51.5 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,797 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:58:59,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,798 INFO L168 Benchmark]: Boogie Preprocessor took 19.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,798 INFO L168 Benchmark]: RCFGBuilder took 202.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,799 INFO L168 Benchmark]: BuchiAutomizer took 3096.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 200.5 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:59,799 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 906.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:58:59,802 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.81 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 202.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3096.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 200.5 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 906.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(l)] + -1 * c1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 44 SDtfs, 45 SDslu, 15 SDs, 0 SdLazy, 12 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf99 lsp92 ukn94 mio100 lsp49 div115 bol100 ite100 ukn100 eq190 hnf83 smp94 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms 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...