./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/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 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:48:25,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:48:25,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:48:25,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:48:25,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:48:25,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:48:25,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:48:25,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:48:25,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:48:25,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:48:25,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:48:25,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:48:25,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:48:25,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:48:25,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:48:25,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:48:25,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:48:25,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:48:25,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:48:25,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:48:25,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:48:25,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:48:25,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:48:25,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:48:25,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:48:25,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:48:25,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:48:25,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:48:25,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:48:25,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:48:25,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:48:25,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:48:25,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:48:25,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:48:25,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:48:25,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:48:25,713 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:48:25,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:48:25,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:48:25,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:48:25,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:48:25,726 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:48:25,726 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:48:25,726 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:48:25,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:48:25,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:48:25,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:48:25,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:48:25,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:48:25,729 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:48:25,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:48:25,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:48:25,729 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:48:25,730 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:48:25,730 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_aa16a61b-e269-4f37-8a8b-a638ec919213/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 -> 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 [2018-11-10 11:48:25,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:48:25,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:48:25,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:48:25,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:48:25,765 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:48:25,765 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:48:25,804 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/data/a895413a9/ad3d158cba6743dfacf79eea8e2322d7/FLAGc4c9a285f [2018-11-10 11:48:26,182 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:48:26,182 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:48:26,189 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/data/a895413a9/ad3d158cba6743dfacf79eea8e2322d7/FLAGc4c9a285f [2018-11-10 11:48:26,198 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/data/a895413a9/ad3d158cba6743dfacf79eea8e2322d7 [2018-11-10 11:48:26,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:48:26,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:48:26,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:48:26,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:48:26,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:48:26,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af148b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26, skipping insertion in model container [2018-11-10 11:48:26,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:48:26,241 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:48:26,436 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:48:26,442 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:48:26,473 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:48:26,518 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:48:26,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26 WrapperNode [2018-11-10 11:48:26,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:48:26,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:48:26,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:48:26,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:48:26,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:48:26,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:48:26,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:48:26,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:48:26,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... [2018-11-10 11:48:26,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:48:26,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:48:26,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:48:26,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:48:26,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa16a61b-e269-4f37-8a8b-a638ec919213/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:48:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:48:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:48:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:48:26,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:48:26,861 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:48:26,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:26 BoogieIcfgContainer [2018-11-10 11:48:26,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:48:26,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:48:26,862 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:48:26,865 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:48:26,866 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:26,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:48:26" (1/3) ... [2018-11-10 11:48:26,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485b09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:48:26, skipping insertion in model container [2018-11-10 11:48:26,867 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:26,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:26" (2/3) ... [2018-11-10 11:48:26,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485b09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:48:26, skipping insertion in model container [2018-11-10 11:48:26,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:26,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:26" (3/3) ... [2018-11-10 11:48:26,870 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:48:26,927 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:48:26,928 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:48:26,928 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:48:26,928 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:48:26,928 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:48:26,928 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:48:26,928 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:48:26,928 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:48:26,929 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:48:26,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:48:26,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 11:48:26,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:26,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:26,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:26,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:48:26,962 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:48:26,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:48:26,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 11:48:26,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:26,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:26,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:26,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:48:26,971 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 7#L385true assume !(main_~length~0 < 1); 11#L385-2true assume !(main_~n~0 < 1); 4#L388-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 14#L393true SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 18#L393-1true assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 24#L370-3true [2018-11-10 11:48:26,972 INFO L795 eck$LassoCheckResult]: Loop: 24#L370-3true assume true; 22#L370-1true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset + 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset + 1; 13#L372true SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 16#L372-1true SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 19#L372-2true assume !(cstrncpy_#t~mem208 == 49);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 24#L370-3true [2018-11-10 11:48:26,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-11-10 11:48:26,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 48855306, now seen corresponding path program 1 times [2018-11-10 11:48:27,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:27,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash -795574524, now seen corresponding path program 1 times [2018-11-10 11:48:27,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:27,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:27,487 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-11-10 11:48:27,583 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:48:27,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:48:27,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:48:27,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:48:27,585 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:48:27,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:48:27,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:48:27,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:48:27,586 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:48:27,586 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:48:27,586 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:48:27,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:27,915 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2018-11-10 11:48:28,038 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-10 11:48:28,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:28,510 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:48:28,514 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:48:28,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-10 11:48:28,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,566 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,596 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:48:28,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,599 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:48:28,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:28,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:28,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:28,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:28,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:28,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:28,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:28,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:28,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:28,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:28,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:28,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:48:28,718 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:48:28,718 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 11:48:28,720 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:48:28,721 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:48:28,722 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:48:28,722 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2018-11-10 11:48:28,782 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 11:48:28,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:28,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:28,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:48:28,853 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-10 11:48:28,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 11:48:28,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 43 states and 52 transitions. Complement of second has 5 states. [2018-11-10 11:48:28,891 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-10 11:48:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:48:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 11:48:28,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 11:48:28,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:28,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 11:48:28,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:28,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-10 11:48:28,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:28,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-11-10 11:48:28,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:48:28,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 23 transitions. [2018-11-10 11:48:28,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:48:28,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 11:48:28,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-10 11:48:28,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:48:28,906 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 11:48:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-10 11:48:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 11:48:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 11:48:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-10 11:48:28,926 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 11:48:28,926 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 11:48:28,926 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:48:28,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-10 11:48:28,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:48:28,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:28,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:28,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:28,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:48:28,928 INFO L793 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 182#L385 assume !(main_~length~0 < 1); 183#L385-2 assume !(main_~n~0 < 1); 177#L388-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 178#L393 SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 190#L393-1 assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 194#L370-3 assume true; 196#L370-1 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset + 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset + 1; 186#L372 SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 188#L372-1 SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 191#L372-2 assume cstrncpy_#t~mem208 == 49;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 181#L375-4 [2018-11-10 11:48:28,928 INFO L795 eck$LassoCheckResult]: Loop: 181#L375-4 assume true; 184#L375-1 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 185#L375-2 assume !!(cstrncpy_#t~post209 != 0);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset + 1; 179#L376 SUMMARY for call write~int(49, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1); srcloc: L376 180#L376-1 havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 181#L375-4 [2018-11-10 11:48:28,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash -795574542, now seen corresponding path program 1 times [2018-11-10 11:48:28,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:28,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:28,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash 63050697, now seen corresponding path program 1 times [2018-11-10 11:48:28,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:28,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 227296120, now seen corresponding path program 1 times [2018-11-10 11:48:28,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:29,365 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 134 [2018-11-10 11:48:29,476 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 11:48:29,478 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:48:29,478 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:48:29,478 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:48:29,478 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:48:29,478 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:48:29,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:48:29,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:48:29,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:48:29,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 11:48:29,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:48:29,479 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:48:29,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,817 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 110 [2018-11-10 11:48:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:29,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:48:30,092 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-11-10 11:48:30,400 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:48:30,400 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:48:30,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:30,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:30,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:30,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:30,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:30,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:30,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:30,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:30,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:30,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:30,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:30,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:30,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:30,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:30,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:48:30,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:48:30,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:30,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:30,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:30,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:30,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:30,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:30,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:30,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:30,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:30,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:30,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:48:30,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:30,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:30,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:48:30,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:30,445 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 11:48:30,446 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:48:30,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:48:30,643 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 11:48:30,644 INFO L444 ModelExtractionUtils]: 107 out of 116 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 11:48:30,644 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:48:30,645 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-10 11:48:30,646 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:48:30,646 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1 Supporting invariants [] [2018-11-10 11:48:30,701 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 11:48:30,703 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:48:30,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:30,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:30,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:48:30,775 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 11:48:30,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 11:48:30,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2018-11-10 11:48:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:48:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:48:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-10 11:48:30,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 11:48:30,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:30,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 11:48:30,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:30,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 11:48:30,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:30,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-10 11:48:30,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:48:30,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:48:30,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:48:30,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:48:30,805 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:48:30,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:48:30,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:48:30,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:48:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:48:30 BoogieIcfgContainer [2018-11-10 11:48:30,813 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:48:30,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:48:30,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:48:30,813 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:48:30,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:26" (3/4) ... [2018-11-10 11:48:30,817 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:48:30,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:48:30,818 INFO L168 Benchmark]: Toolchain (without parser) took 4616.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 957.6 MB in the beginning and 951.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 328.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:30,818 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-10 11:48:30,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:30,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 930.8 MB in the beginning and 1.2 GB in the end (delta: -227.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:30,820 INFO L168 Benchmark]: Boogie Preprocessor took 16.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:48:30,820 INFO L168 Benchmark]: RCFGBuilder took 243.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:30,821 INFO L168 Benchmark]: BuchiAutomizer took 3950.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 178.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:30,821 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:48:30,824 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 316.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 930.8 MB in the beginning and 1.2 GB in the end (delta: -227.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 243.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3950.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 178.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 951.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[us] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 41 SDslu, 19 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital245 mio100 ax100 hnf99 lsp97 ukn105 mio100 lsp47 div100 bol100 ite100 ukn100 eq201 hnf88 smp97 dnf117 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 210ms VariablesStem: 22 VariablesLoop: 15 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...