./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/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_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/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-635dfa2 [2018-12-02 13:50:07,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:50:07,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:50:07,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:50:07,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:50:07,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:50:07,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:50:07,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:50:07,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:50:07,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:50:07,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:50:07,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:50:07,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:50:07,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:50:07,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:50:07,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:50:07,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:50:07,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:50:07,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:50:07,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:50:07,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:50:07,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:50:07,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:50:07,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:50:07,966 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:50:07,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:50:07,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:50:07,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:50:07,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:50:07,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:50:07,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:50:07,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:50:07,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:50:07,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:50:07,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:50:07,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:50:07,971 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 13:50:07,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:50:07,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:50:07,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:50:07,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:50:07,983 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:50:07,984 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 13:50:07,984 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 13:50:07,984 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 13:50:07,984 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 13:50:07,984 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 13:50:07,984 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 13:50:07,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:50:07,985 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 13:50:07,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 13:50:07,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:50:07,986 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 13:50:07,987 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 13:50:07,987 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_b3a79b72-4451-4da2-a6d9-d06e1c267a15/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-12-02 13:50:08,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:50:08,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:50:08,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:50:08,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:50:08,017 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:50:08,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-12-02 13:50:08,052 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/data/f8c1278c2/6a9d500754c84b64ad41a7499c13ad6e/FLAG0f101374e [2018-12-02 13:50:08,527 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:50:08,527 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-12-02 13:50:08,533 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/data/f8c1278c2/6a9d500754c84b64ad41a7499c13ad6e/FLAG0f101374e [2018-12-02 13:50:08,543 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/bin-2019/uautomizer/data/f8c1278c2/6a9d500754c84b64ad41a7499c13ad6e [2018-12-02 13:50:08,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:50:08,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:50:08,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:50:08,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:50:08,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:50:08,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@848fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08, skipping insertion in model container [2018-12-02 13:50:08,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:50:08,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:50:08,765 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:50:08,772 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:50:08,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:50:08,855 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:50:08,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08 WrapperNode [2018-12-02 13:50:08,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:50:08,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:50:08,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:50:08,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:50:08,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:50:08,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:50:08,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:50:08,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:50:08,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... [2018-12-02 13:50:08,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:50:08,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:50:08,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:50:08,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:50:08,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3a79b72-4451-4da2-a6d9-d06e1c267a15/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-12-02 13:50:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:50:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 13:50:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:50:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 13:50:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:50:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:50:09,058 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:50:09,058 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 13:50:09,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:09 BoogieIcfgContainer [2018-12-02 13:50:09,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:50:09,059 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 13:50:09,059 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 13:50:09,062 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 13:50:09,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:50:09,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:50:08" (1/3) ... [2018-12-02 13:50:09,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4346d9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:50:09, skipping insertion in model container [2018-12-02 13:50:09,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:50:09,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:08" (2/3) ... [2018-12-02 13:50:09,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4346d9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:50:09, skipping insertion in model container [2018-12-02 13:50:09,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:50:09,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:09" (3/3) ... [2018-12-02 13:50:09,066 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_diffterm_alloca_true-termination.c.i [2018-12-02 13:50:09,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:50:09,107 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 13:50:09,107 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 13:50:09,108 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 13:50:09,108 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:50:09,108 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:50:09,108 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 13:50:09,108 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:50:09,108 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 13:50:09,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 13:50:09,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 13:50:09,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:50:09,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:50:09,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:50:09,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:50:09,134 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 13:50:09,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 13:50:09,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 13:50:09,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:50:09,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:50:09,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:50:09,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:50:09,140 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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; 4#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);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; 14#L370-2true [2018-12-02 13:50:09,141 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true 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, 1 + cstrncpy_#t~post206.offset;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, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(49 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2018-12-02 13:50:09,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 13:50:09,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:09,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-12-02 13:50:09,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:09,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-12-02 13:50:09,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:09,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:09,528 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-12-02 13:50:09,602 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:50:09,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:50:09,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:50:09,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:50:09,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:50:09,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:50:09,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:50:09,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:50:09,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 13:50:09,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:50:09,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:50:09,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,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-12-02 13:50:09,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,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-12-02 13:50:09,826 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-12-02 13:50:09,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:09,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:10,276 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:50:10,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:50:10,281 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-12-02 13:50:10,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,286 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-12-02 13:50:10,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,288 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-12-02 13:50:10,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,290 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-12-02 13:50:10,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,296 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-12-02 13:50:10,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,301 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-12-02 13:50:10,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,304 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-12-02 13:50:10,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,306 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-12-02 13:50:10,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,308 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-12-02 13:50:10,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,310 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-12-02 13:50:10,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,312 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-12-02 13:50:10,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,314 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-12-02 13:50:10,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,316 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-12-02 13:50:10,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,319 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-12-02 13:50:10,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:50:10,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,330 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-12-02 13:50:10,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:10,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:10,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:10,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:50:10,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:50:10,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,340 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-12-02 13:50:10,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,353 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-12-02 13:50:10,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:50:10,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,356 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:50:10,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,369 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-12-02 13:50:10,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:10,378 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-12-02 13:50:10,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:10,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:10,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:10,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:10,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:10,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:10,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:50:10,455 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 13:50:10,455 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 13:50:10,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:50:10,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:50:10,458 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:50:10,458 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1) = -1*ULTIMATE.start_cstrncpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1 Supporting invariants [] [2018-12-02 13:50:10,495 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-02 13:50:10,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:50:10,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:10,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:10,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:50:10,585 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-12-02 13:50:10,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-12-02 13:50:10,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 6 states. [2018-12-02 13:50:10,628 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-12-02 13:50:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 13:50:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-12-02 13:50:10,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 13:50:10,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:10,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 13:50:10,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:10,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 13:50:10,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:10,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2018-12-02 13:50:10,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 13:50:10,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-12-02 13:50:10,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 13:50:10,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 13:50:10,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-02 13:50:10,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:50:10,638 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 13:50:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-02 13:50:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-02 13:50:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 13:50:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 13:50:10,653 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 13:50:10,653 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 13:50:10,653 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 13:50:10,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 13:50:10,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 13:50:10,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:50:10,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:50:10,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:10,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 13:50:10,654 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 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; 149#L385 assume !(main_~length~0 < 1); 153#L385-2 assume !(main_~n~0 < 1); 151#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);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; 152#L370-2 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, 1 + cstrncpy_#t~post206.offset;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, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 146#L372 assume 49 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;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; 144#L375-3 [2018-12-02 13:50:10,654 INFO L796 eck$LassoCheckResult]: Loop: 144#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 145#L375-1 assume !!(0 != cstrncpy_#t~post209);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, 1 + cstrncpy_#t~post210.offset;call write~int(49, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 144#L375-3 [2018-12-02 13:50:10,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-12-02 13:50:10,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:10,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:10,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-12-02 13:50:10,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-12-02 13:50:10,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:10,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:10,983 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2018-12-02 13:50:11,078 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:50:11,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:50:11,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:50:11,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:50:11,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:50:11,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:50:11,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:50:11,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:50:11,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 13:50:11,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:50:11,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:50:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,266 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2018-12-02 13:50:11,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:50:11,701 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:50:11,702 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:50:11,702 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-12-02 13:50:11,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,705 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-12-02 13:50:11,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,706 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-12-02 13:50:11,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,708 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-12-02 13:50:11,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,710 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-12-02 13:50:11,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:11,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:11,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,713 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-12-02 13:50:11,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,715 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-12-02 13:50:11,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,715 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:50:11,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,718 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:50:11,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:11,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,736 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-12-02 13:50:11,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,738 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-12-02 13:50:11,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:11,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:11,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,741 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-12-02 13:50:11,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:11,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:11,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,745 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-12-02 13:50:11,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:50:11,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:50:11,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:50:11,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:50:11,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:50:11,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:50:11,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:50:11,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:50:11,751 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-12-02 13:50:11,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:50:11,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:50:11,752 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 13:50:11,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:50:11,762 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 13:50:11,762 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 13:50:11,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:50:11,852 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 13:50:11,853 INFO L444 ModelExtractionUtils]: 95 out of 106 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-02 13:50:11,853 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:50:11,854 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 13:50:11,854 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:50:11,854 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-12-02 13:50:11,898 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 13:50:11,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:50:11,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:11,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:11,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:50:11,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-12-02 13:50:11,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-02 13:50:11,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-12-02 13:50:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:50:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:50:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-02 13:50:11,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 13:50:11,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:11,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 13:50:11,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:11,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 13:50:11,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:50:11,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-12-02 13:50:11,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:50:11,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-02 13:50:11,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 13:50:11,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 13:50:11,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 13:50:11,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:50:11,968 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:50:11,969 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:50:11,969 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:50:11,969 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 13:50:11,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 13:50:11,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:50:11,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 13:50:11,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:50:11 BoogieIcfgContainer [2018-12-02 13:50:11,973 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 13:50:11,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:50:11,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:50:11,973 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:50:11,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:09" (3/4) ... [2018-12-02 13:50:11,976 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 13:50:11,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:50:11,976 INFO L168 Benchmark]: Toolchain (without parser) took 3431.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.2 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -216.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:11,977 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:11,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:11,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:11,978 INFO L168 Benchmark]: Boogie Preprocessor took 13.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:11,978 INFO L168 Benchmark]: RCFGBuilder took 164.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:11,978 INFO L168 Benchmark]: BuchiAutomizer took 2913.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -120.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:11,979 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:11,981 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2913.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -120.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * dst + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 23 SDslu, 11 SDs, 0 SdLazy, 12 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp96 ukn87 mio100 lsp54 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 103ms VariablesStem: 20 VariablesLoop: 12 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...