./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/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 32bit --witnessprinter.graph.data.programhash bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:32,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:32,046 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:32,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:32,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:32,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:32,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:32,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:32,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:32,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:32,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:32,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:32,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:32,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:32,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:32,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:32,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:32,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:32,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:32,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:32,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:32,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:32,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:32,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:32,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:32,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:32,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:32,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:32,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:32,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:32,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:32,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:32,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:32,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:32,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:32,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:32,072 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:34:32,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:32,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:32,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:32,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:32,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:32,084 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:32,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:32,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:32,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:32,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:32,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:32,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:32,087 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:32,087 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:32,087 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_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-11-18 08:34:32,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:32,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:32,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:32,119 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:32,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:32,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:34:32,157 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/data/c47be75dd/d4de2dcc2e104fda934b5b913f960d85/FLAG21ec376bf [2018-11-18 08:34:32,499 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:32,499 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:34:32,509 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/data/c47be75dd/d4de2dcc2e104fda934b5b913f960d85/FLAG21ec376bf [2018-11-18 08:34:32,518 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/data/c47be75dd/d4de2dcc2e104fda934b5b913f960d85 [2018-11-18 08:34:32,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:32,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:32,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:32,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:32,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:32,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486b3616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32, skipping insertion in model container [2018-11-18 08:34:32,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:32,569 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:32,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:32,808 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:32,883 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:32,905 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:32,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32 WrapperNode [2018-11-18 08:34:32,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:32,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:32,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:32,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:32,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:32,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:32,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:32,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:32,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... [2018-11-18 08:34:32,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:32,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:32,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:32,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:32,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9219a19d-13f1-4cf8-a71a-7ef7bfbe48ee/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:32,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:33,166 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:33,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:33 BoogieIcfgContainer [2018-11-18 08:34:33,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:33,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:33,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:33,171 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:33,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:33,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:32" (1/3) ... [2018-11-18 08:34:33,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5221381a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:33, skipping insertion in model container [2018-11-18 08:34:33,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:33,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:32" (2/3) ... [2018-11-18 08:34:33,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5221381a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:33, skipping insertion in model container [2018-11-18 08:34:33,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:33,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:33" (3/3) ... [2018-11-18 08:34:33,178 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:34:33,217 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:33,217 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:33,217 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:33,217 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:33,217 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:33,218 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:33,218 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:33,218 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:33,218 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:33,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:34:33,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:33,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:33,251 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:33,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:34:33,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:33,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:33,261 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 20#L559true assume !(main_~length~0 < 1); 6#L559-2true assume !(main_~n~0 < 1); 18#L562-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 12#L543true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 14#L546-4true [2018-11-18 08:34:33,262 INFO L796 eck$LassoCheckResult]: Loop: 14#L546-4true assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 4#L547true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 8#L546-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 10#L546-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 14#L546-4true [2018-11-18 08:34:33,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-18 08:34:33,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1619705, now seen corresponding path program 1 times [2018-11-18 08:34:33,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1592247556, now seen corresponding path program 1 times [2018-11-18 08:34:33,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,570 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-18 08:34:33,857 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-11-18 08:34:33,937 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:33,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:33,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:33,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:33,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:33,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:33,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:33,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 08:34:33,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:33,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:33,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,209 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-18 08:34:34,593 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-18 08:34:34,878 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:34,883 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:34,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:34,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:34,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:34,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:34,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:34,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:34,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:34,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:34,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:34,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,949 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:34,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,952 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:34,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:34,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:34,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:34,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:34,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:34,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:34,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:34,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:34,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,041 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:35,093 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 08:34:35,093 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 08:34:35,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:35,096 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:35,096 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:35,097 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-11-18 08:34:35,159 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 08:34:35,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:35,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:35,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 08:34:35,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 08:34:35,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 38 states and 46 transitions. Complement of second has 7 states. [2018-11-18 08:34:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-18 08:34:35,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 08:34:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 08:34:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 08:34:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2018-11-18 08:34:35,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:35,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 15 states and 18 transitions. [2018-11-18 08:34:35,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:34:35,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:34:35,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2018-11-18 08:34:35,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:35,341 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-18 08:34:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2018-11-18 08:34:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-18 08:34:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 08:34:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 08:34:35,358 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 08:34:35,359 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 08:34:35,359 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:35,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 08:34:35,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:35,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:35,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:35,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,360 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:35,360 INFO L794 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 183#L559 assume !(main_~length~0 < 1); 176#L559-2 assume !(main_~n~0 < 1); 177#L562-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 180#L543 assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 181#L546-4 assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 171#L547 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 172#L548-4 [2018-11-18 08:34:35,360 INFO L796 eck$LassoCheckResult]: Loop: 172#L548-4 assume true; 174#L548-1 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 175#L548-2 assume !!(0 != cstrncpy_#t~pre6 % 4294967296);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 172#L548-4 [2018-11-18 08:34:35,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-11-18 08:34:35,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 58657, now seen corresponding path program 1 times [2018-11-18 08:34:35,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2114543379, now seen corresponding path program 1 times [2018-11-18 08:34:35,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,762 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2018-11-18 08:34:35,848 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:35,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:35,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:35,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:35,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:35,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:35,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:35,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:35,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 08:34:35,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:35,849 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:35,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,044 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-18 08:34:36,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-11-18 08:34:36,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-11-18 08:34:36,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-11-18 08:34:36,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-11-18 08:34:36,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-11-18 08:34:36,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:36,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:36,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,552 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:36,589 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 08:34:36,589 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:34:36,590 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:36,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:36,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:36,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-11-18 08:34:36,634 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-18 08:34:36,639 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:36,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:36,709 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2018-11-18 08:34:36,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 08:34:36,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 17 states and 21 transitions. Complement of second has 6 states. [2018-11-18 08:34:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-18 08:34:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 08:34:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 08:34:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 08:34:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 08:34:36,768 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:36,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:36,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:36,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:36,769 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:36,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:36,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:36,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:36,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:36 BoogieIcfgContainer [2018-11-18 08:34:36,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:36,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:36,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:36,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:36,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:33" (3/4) ... [2018-11-18 08:34:36,781 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:36,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:36,782 INFO L168 Benchmark]: Toolchain (without parser) took 4260.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 956.6 MB in the beginning and 891.0 MB in the end (delta: 65.5 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:36,783 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:36,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:36,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:36,784 INFO L168 Benchmark]: Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:36,785 INFO L168 Benchmark]: RCFGBuilder took 213.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:36,785 INFO L168 Benchmark]: BuchiAutomizer took 3608.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 204.5 MB). Peak memory consumption was 265.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:36,786 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 1.2 GB. Free memory is still 891.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:36,789 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3608.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 204.5 MB). Peak memory consumption was 265.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 1.2 GB. Free memory is still 891.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 44 SDslu, 28 SDs, 0 SdLazy, 16 SolverSat, 12 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 lsp97 ukn85 mio100 lsp51 div182 bol100 ite100 ukn100 eq173 hnf68 smp93 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...