./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcat-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcat-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76da3a81dee1d435f94d1997f88b6b1f891a43a1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:09,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:09,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:09,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:09,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:09,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:09,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:09,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:09,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:09,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:09,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:09,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:09,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:09,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:09,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:09,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:09,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:09,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:09,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:09,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:09,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:09,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:09,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:09,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:09,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:09,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:09,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:09,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:09,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:09,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:09,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:09,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:09,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:09,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:09,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:09,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:09,190 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:09,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:09,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:09,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:09,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:09,204 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:09,205 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:09,205 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:09,205 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:09,205 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:09,205 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:09,205 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:09,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:09,206 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:09,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:09,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:09,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:09,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:09,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:09,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:09,207 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:09,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:09,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:09,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:09,208 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:09,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:09,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:09,208 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:09,209 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:09,209 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_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76da3a81dee1d435f94d1997f88b6b1f891a43a1 [2018-10-27 06:06:09,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:09,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:09,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:09,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:09,269 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:09,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcat-alloca_true-termination.c.i [2018-10-27 06:06:09,324 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/data/4f5e3dac8/81ead3586dc14dec8a8f625e50e88126/FLAG3858c6e34 [2018-10-27 06:06:09,766 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:09,766 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcat-alloca_true-termination.c.i [2018-10-27 06:06:09,780 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/data/4f5e3dac8/81ead3586dc14dec8a8f625e50e88126/FLAG3858c6e34 [2018-10-27 06:06:09,796 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/bin-2019/uautomizer/data/4f5e3dac8/81ead3586dc14dec8a8f625e50e88126 [2018-10-27 06:06:09,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:09,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:09,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:09,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:09,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:09,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:09" (1/1) ... [2018-10-27 06:06:09,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717667f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:09, skipping insertion in model container [2018-10-27 06:06:09,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:09" (1/1) ... [2018-10-27 06:06:09,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:09,862 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:10,142 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:10,151 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:10,192 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:10,232 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:10,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10 WrapperNode [2018-10-27 06:06:10,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:10,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:10,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:10,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:10,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:10,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:10,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:10,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:10,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... [2018-10-27 06:06:10,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:10,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:10,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:10,377 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:10,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28e070d1-f691-4c79-8c08-f553b1dd1acd/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-10-27 06:06:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:10,944 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:10,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:10 BoogieIcfgContainer [2018-10-27 06:06:10,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:10,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:10,946 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:10,950 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:10,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:10,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:09" (1/3) ... [2018-10-27 06:06:10,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1045362b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:10, skipping insertion in model container [2018-10-27 06:06:10,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:10,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:10" (2/3) ... [2018-10-27 06:06:10,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1045362b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:10, skipping insertion in model container [2018-10-27 06:06:10,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:10,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:10" (3/3) ... [2018-10-27 06:06:10,955 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-termination.c.i [2018-10-27 06:06:11,012 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:11,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:11,013 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:11,013 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:11,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:11,014 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:11,015 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:11,015 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:11,015 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:11,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:06:11,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:11,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:11,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:11,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:11,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:11,070 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:11,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:06:11,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:11,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:11,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:11,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:11,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:11,082 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, 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_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 25#L559true assume !(main_~length1~0 < 1); 5#L559-2true assume !(main_~length2~0 < 2); 17#L562-1true assume !(main_~length3~0 < 1); 9#L565-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 20#L571true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L571 24#L571-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L571-1 16#L572true assume { :begin_inline_cstrcat } true;cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 6#L551-5true [2018-10-27 06:06:11,082 INFO L795 eck$LassoCheckResult]: Loop: 6#L551-5true assume true; 18#L551-1true SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L551-1 22#L551-2true assume !!(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 4#L551-4true cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 6#L551-5true [2018-10-27 06:06:11,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-10-27 06:06:11,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1909764, now seen corresponding path program 1 times [2018-10-27 06:06:11,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 542953743, now seen corresponding path program 1 times [2018-10-27 06:06:11,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,366 WARN L179 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-10-27 06:06:12,759 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 06:06:12,771 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:12,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:12,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:12,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:12,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:12,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:12,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:12,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:12,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:12,774 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:12,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,219 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-10-27 06:06:13,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,671 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:06:14,046 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:14,051 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:14,054 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-10-27 06:06:14,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,066 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-10-27 06:06:14,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,077 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-10-27 06:06:14,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,090 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-10-27 06:06:14,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,107 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-10-27 06:06:14,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,145 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-10-27 06:06:14,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:14,168 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-10-27 06:06:14,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:14,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:14,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:14,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:14,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:14,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:14,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:14,306 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:14,314 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:06:14,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:14,318 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:14,318 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:14,319 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-10-27 06:06:14,420 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:06:14,425 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:06:14,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:14,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:06:14,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:14,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:14,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:14,561 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-10-27 06:06:14,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 5 states. [2018-10-27 06:06:14,787 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:06:14,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 5 states. Result 56 states and 67 transitions. Complement of second has 8 states. [2018-10-27 06:06:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:06:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-10-27 06:06:14,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 9 letters. Loop has 4 letters. [2018-10-27 06:06:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:14,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 13 letters. Loop has 4 letters. [2018-10-27 06:06:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:14,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 9 letters. Loop has 8 letters. [2018-10-27 06:06:14,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:14,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2018-10-27 06:06:14,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:06:14,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 23 states and 27 transitions. [2018-10-27 06:06:14,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-10-27 06:06:14,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:06:14,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:06:14,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:14,863 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:06:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:06:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-27 06:06:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:06:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-10-27 06:06:14,893 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-10-27 06:06:14,893 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-10-27 06:06:14,893 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:14,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-10-27 06:06:14,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:06:14,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:14,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:14,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:14,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:14,897 INFO L793 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, 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_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 198#L559 assume !(main_~length1~0 < 1); 193#L559-2 assume !(main_~length2~0 < 2); 194#L562-1 assume !(main_~length3~0 < 1); 199#L565-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 200#L571 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L571 207#L571-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L571-1 204#L572 assume { :begin_inline_cstrcat } true;cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 195#L551-5 assume true; 196#L551-1 SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L551-1 206#L551-2 assume !(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 189#L552-5 [2018-10-27 06:06:14,897 INFO L795 eck$LassoCheckResult]: Loop: 189#L552-5 assume true; 190#L552 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 202#L552-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L552-1 203#L552-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L552-2 205#L552-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; 189#L552-5 [2018-10-27 06:06:14,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535287, now seen corresponding path program 1 times [2018-10-27 06:06:14,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:14,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:14,932 INFO L82 PathProgramCache]: Analyzing trace with hash 72589779, now seen corresponding path program 1 times [2018-10-27 06:06:14,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:14,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:14,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 291577181, now seen corresponding path program 1 times [2018-10-27 06:06:14,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,312 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2018-10-27 06:06:15,487 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 06:06:15,505 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:15,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:15,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:15,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:15,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:15,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:15,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:15,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:15,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:06:15,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:15,506 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:15,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,920 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-10-27 06:06:16,111 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-10-27 06:06:16,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:16,689 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:16,690 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:16,690 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-10-27 06:06:16,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:16,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,697 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-10-27 06:06:16,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:16,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,712 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-10-27 06:06:16,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,720 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-10-27 06:06:16,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,722 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-10-27 06:06:16,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,729 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-10-27 06:06:16,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,735 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-10-27 06:06:16,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,737 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-10-27 06:06:16,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:16,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,749 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-10-27 06:06:16,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,760 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-10-27 06:06:16,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,767 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-10-27 06:06:16,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,769 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-10-27 06:06:16,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,778 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-10-27 06:06:16,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,782 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-10-27 06:06:16,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,785 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-10-27 06:06:16,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:16,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,795 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-10-27 06:06:16,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,802 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-10-27 06:06:16,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,809 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-10-27 06:06:16,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,821 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-10-27 06:06:16,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,829 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-10-27 06:06:16,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,830 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:16,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,835 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:16,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,845 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-10-27 06:06:16,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,852 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-10-27 06:06:16,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,859 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-10-27 06:06:16,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,873 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-10-27 06:06:16,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:16,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,877 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:16,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:16,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:16,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,879 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-10-27 06:06:16,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,889 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-10-27 06:06:16,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,890 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:16,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:16,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,904 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-10-27 06:06:16,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:16,912 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-10-27 06:06:16,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:16,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:16,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:16,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:16,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:16,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:16,954 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:16,983 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:16,983 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:06:16,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:16,984 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:16,985 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:16,985 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~append.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrcat_~append.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-10-27 06:06:17,123 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:06:17,126 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:17,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:17,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:17,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:06:17,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-10-27 06:06:17,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 25 states and 30 transitions. Complement of second has 8 states. [2018-10-27 06:06:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-10-27 06:06:17,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:06:17,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:17,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:06:17,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:17,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:06:17,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:17,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-10-27 06:06:17,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:17,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-10-27 06:06:17,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:17,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:17,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:17,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:17,409 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:17,409 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:17,409 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:17,409 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:17,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:17,409 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:17,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:17,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:17 BoogieIcfgContainer [2018-10-27 06:06:17,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:17,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:17,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:17,416 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:17,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:10" (3/4) ... [2018-10-27 06:06:17,423 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:17,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:17,423 INFO L168 Benchmark]: Toolchain (without parser) took 7622.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 951.8 MB in the beginning and 887.2 MB in the end (delta: 64.5 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:17,424 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:17,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:17,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -218.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:17,431 INFO L168 Benchmark]: Boogie Preprocessor took 30.45 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-10-27 06:06:17,431 INFO L168 Benchmark]: RCFGBuilder took 569.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:17,432 INFO L168 Benchmark]: BuchiAutomizer took 6469.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 238.2 MB). Peak memory consumption was 279.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:17,433 INFO L168 Benchmark]: Witness Printer took 7.22 ms. Allocated memory is still 1.2 GB. Free memory is still 887.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:17,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 430.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -218.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 569.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6469.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 238.2 MB). Peak memory consumption was 279.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.22 ms. Allocated memory is still 1.2 GB. Free memory is still 887.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function -1 * append + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40 SDtfs, 53 SDslu, 46 SDs, 0 SdLazy, 28 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax108 hnf99 lsp89 ukn100 mio100 lsp43 div100 bol100 ite100 ukn100 eq194 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...