./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b29929f70f48b1f1b1180a065dc51df3698b29b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:56:39,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:56:39,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:56:39,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:56:39,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:56:39,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:56:39,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:56:39,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:56:39,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:56:39,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:56:39,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:56:39,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:56:39,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:56:39,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:56:39,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:56:39,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:56:39,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:56:39,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:56:39,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:56:39,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:56:39,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:56:39,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:56:39,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:56:39,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:56:39,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:56:39,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:56:39,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:56:39,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:56:39,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:56:39,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:56:39,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:56:39,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:56:39,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:56:39,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:56:39,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:56:39,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:56:39,424 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 01:56:39,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:56:39,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:56:39,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:56:39,435 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:56:39,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:56:39,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:56:39,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:56:39,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:56:39,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:56:39,438 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:56:39,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:56:39,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:56:39,438 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:56:39,439 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:56:39,439 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_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-11-10 01:56:39,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:56:39,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:56:39,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:56:39,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:56:39,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:56:39,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 01:56:39,517 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/data/7b2c0977f/c8234fe866cb4e629724cf88e98109c8/FLAGf47709fd4 [2018-11-10 01:56:39,871 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:56:39,872 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 01:56:39,882 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/data/7b2c0977f/c8234fe866cb4e629724cf88e98109c8/FLAGf47709fd4 [2018-11-10 01:56:39,893 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/data/7b2c0977f/c8234fe866cb4e629724cf88e98109c8 [2018-11-10 01:56:39,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:56:39,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:56:39,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:56:39,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:56:39,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:56:39,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:56:39" (1/1) ... [2018-11-10 01:56:39,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:39, skipping insertion in model container [2018-11-10 01:56:39,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:56:39" (1/1) ... [2018-11-10 01:56:39,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:56:39,935 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:56:40,116 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:56:40,123 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:56:40,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:56:40,177 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:56:40,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40 WrapperNode [2018-11-10 01:56:40,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:56:40,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:56:40,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:56:40,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:56:40,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:56:40,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:56:40,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:56:40,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:56:40,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... [2018-11-10 01:56:40,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:56:40,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:56:40,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:56:40,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:56:40,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ef553fa-ef9c-4f32-a917-7ccb9fa850bd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:56:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:56:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:56:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 01:56:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 01:56:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:56:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:56:40,525 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:56:40,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:56:40 BoogieIcfgContainer [2018-11-10 01:56:40,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:56:40,526 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:56:40,526 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:56:40,529 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:56:40,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:56:40,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:56:39" (1/3) ... [2018-11-10 01:56:40,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa99a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:56:40, skipping insertion in model container [2018-11-10 01:56:40,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:56:40,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:56:40" (2/3) ... [2018-11-10 01:56:40,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa99a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:56:40, skipping insertion in model container [2018-11-10 01:56:40,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:56:40,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:56:40" (3/3) ... [2018-11-10 01:56:40,533 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 01:56:40,571 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:56:40,572 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:56:40,572 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:56:40,572 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:56:40,572 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:56:40,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:56:40,572 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:56:40,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:56:40,572 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:56:40,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 01:56:40,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 01:56:40,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:56:40,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:56:40,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:56:40,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:56:40,604 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:56:40,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 01:56:40,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 01:56:40,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:56:40,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:56:40,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:56:40,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:56:40,615 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 15#L561true assume !(main_~length~0 < 1); 19#L561-2true assume !(main_~n~0 < 1); 29#L564-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 20#L569true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L569 21#L569-1true assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;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];cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 31#L540true SUMMARY for call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L540 33#L540-1true cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 26#L543true assume cstpncpy_~n % 4294967296 != 0; 9#L544true SUMMARY for call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L544 11#L544-1true cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset; 6#L546true SUMMARY for call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L546 8#L546-1true SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + (if cstpncpy_~n % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n % 4294967296 % 4294967296 else cstpncpy_~n % 4294967296 % 4294967296 - 4294967296) * 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L546-1 10#L546-2true havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 27#L547-4true [2018-11-10 01:56:40,615 INFO L795 eck$LassoCheckResult]: Loop: 27#L547-4true assume true;cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset + 1;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset + 1; 3#L548true SUMMARY for call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1); srcloc: L548 4#L548-1true SUMMARY for call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); srcloc: L548-1 7#L548-2true assume !(cstpncpy_#t~mem7 == 0);havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset; 22#L547-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 24#L547-2true assume !!(cstpncpy_#t~pre4 % 4294967296 != 0);havoc cstpncpy_#t~pre4; 27#L547-4true [2018-11-10 01:56:40,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash -952729461, now seen corresponding path program 1 times [2018-11-10 01:56:40,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:40,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:40,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1805597821, now seen corresponding path program 1 times [2018-11-10 01:56:40,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:40,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 336702855, now seen corresponding path program 1 times [2018-11-10 01:56:40,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:40,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:40,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:41,551 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 156 [2018-11-10 01:56:42,304 WARN L179 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2018-11-10 01:56:42,314 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:56:42,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:56:42,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:56:42,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:56:42,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:56:42,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:56:42,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:56:42,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:56:42,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 01:56:42,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:56:42,316 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:56:42,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,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-11-10 01:56:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,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-11-10 01:56:42,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:42,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 01:56:43,113 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 123 [2018-11-10 01:56:43,227 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-11-10 01:56:43,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:43,698 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2018-11-10 01:56:43,828 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-10 01:56:44,437 WARN L179 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-11-10 01:56:44,550 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:56:44,555 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:56:44,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:44,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:44,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,609 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:56:44,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,610 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:56:44,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:44,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,623 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:44,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:44,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:44,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:44,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,662 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:44,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:44,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:44,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:44,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:44,668 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:44,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:44,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:44,674 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:44,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:44,769 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:56:44,815 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 01:56:44,815 INFO L444 ModelExtractionUtils]: 65 out of 70 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 01:56:44,817 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:56:44,818 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:56:44,819 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:56:44,819 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1) = -1*ULTIMATE.start_cstpncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 Supporting invariants [] [2018-11-10 01:56:44,897 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-10 01:56:44,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 01:56:44,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:56:44,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:56:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:56:45,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:56:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:56:45,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 01:56:45,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 8 states. [2018-11-10 01:56:45,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 8 states. Result 61 states and 69 transitions. Complement of second has 12 states. [2018-11-10 01:56:45,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 01:56:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 01:56:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2018-11-10 01:56:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 49 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-10 01:56:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 49 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-10 01:56:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 49 transitions. Stem has 15 letters. Loop has 12 letters. [2018-11-10 01:56:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:45,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 69 transitions. [2018-11-10 01:56:45,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 01:56:45,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 29 states and 32 transitions. [2018-11-10 01:56:45,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 01:56:45,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 01:56:45,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2018-11-10 01:56:45,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:56:45,299 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 01:56:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2018-11-10 01:56:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 01:56:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 01:56:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-10 01:56:45,323 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 01:56:45,323 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 01:56:45,323 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:56:45,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-11-10 01:56:45,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 01:56:45,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:56:45,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:56:45,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:56:45,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 01:56:45,325 INFO L793 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 292#L561 assume !(main_~length~0 < 1); 293#L561-2 assume !(main_~n~0 < 1); 296#L564-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 297#L569 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L569 298#L569-1 assume { :begin_inline_cstpncpy } true;cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;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];cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 299#L540 SUMMARY for call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L540 305#L540-1 cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 302#L543 assume cstpncpy_~n % 4294967296 != 0; 288#L544 SUMMARY for call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L544 289#L544-1 cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset; 283#L546 SUMMARY for call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L546 284#L546-1 SUMMARY for call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + (if cstpncpy_~n % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n % 4294967296 % 4294967296 else cstpncpy_~n % 4294967296 % 4294967296 - 4294967296) * 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L546-1 287#L546-2 havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 290#L547-4 assume true;cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset + 1;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset + 1; 277#L548 SUMMARY for call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1); srcloc: L548 278#L548-1 SUMMARY for call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); srcloc: L548-1 280#L548-2 assume cstpncpy_#t~mem7 == 0;havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset; 285#L549 SUMMARY for call write~$Pointer$(cstpncpy_~d~0.base, cstpncpy_~d~0.offset - 1, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4); srcloc: L549 281#L550-3 [2018-11-10 01:56:45,325 INFO L795 eck$LassoCheckResult]: Loop: 281#L550-3 assume true; 282#L550 cstpncpy_#t~pre8 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 294#L550-1 assume !!(cstpncpy_#t~pre8 % 4294967296 != 0);havoc cstpncpy_#t~pre8;cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset + 1; 295#L551 SUMMARY for call write~int(0, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, 1); srcloc: L551 304#L551-1 havoc cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset; 281#L550-3 [2018-11-10 01:56:45,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1513159882, now seen corresponding path program 1 times [2018-11-10 01:56:45,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:45,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:45,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 67822222, now seen corresponding path program 1 times [2018-11-10 01:56:45,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:45,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash 546740345, now seen corresponding path program 1 times [2018-11-10 01:56:45,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:56:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:46,610 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 217 DAG size of output: 198 [2018-11-10 01:56:47,065 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 126 [2018-11-10 01:56:47,067 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:56:47,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:56:47,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:56:47,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:56:47,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:56:47,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:56:47,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:56:47,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:56:47,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 01:56:47,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:56:47,068 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:56:47,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,459 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2018-11-10 01:56:47,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:56:47,844 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-11-10 01:56:48,181 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:56:48,182 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:56:48,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,236 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:48,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,238 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:48,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:48,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,260 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:48,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,263 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:56:48,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,264 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:56:48,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:56:48,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:56:48,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:56:48,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:56:48,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:56:48,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:56:48,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:56:48,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:56:48,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:56:48,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:56:48,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:56:48,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:56:48,348 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 01:56:48,349 INFO L444 ModelExtractionUtils]: 58 out of 67 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 01:56:48,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:56:48,350 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:56:48,350 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:56:48,350 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstpncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-10 01:56:48,416 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 01:56:48,418 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 01:56:48,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:56:48,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:56:48,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:56:48,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:56:48,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 01:56:48,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:56:48,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:56:48,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:48,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-10 01:56:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:56:48,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:56:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:56:48,602 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-11-10 01:56:48,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 01:56:48,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand 10 states. Result 35 states and 39 transitions. Complement of second has 12 states. [2018-11-10 01:56:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 01:56:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 01:56:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-11-10 01:56:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 01:56:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 01:56:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 01:56:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:56:48,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2018-11-10 01:56:48,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:56:48,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-10 01:56:48,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 01:56:48,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 01:56:48,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 01:56:48,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:56:48,806 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:56:48,806 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:56:48,807 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:56:48,807 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:56:48,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:56:48,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:56:48,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 01:56:48,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:56:48 BoogieIcfgContainer [2018-11-10 01:56:48,814 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:56:48,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:56:48,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:56:48,814 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:56:48,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:56:40" (3/4) ... [2018-11-10 01:56:48,817 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 01:56:48,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:56:48,818 INFO L168 Benchmark]: Toolchain (without parser) took 8922.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.0 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -42.5 MB). Peak memory consumption was 206.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,819 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:56:48,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,820 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,820 INFO L168 Benchmark]: RCFGBuilder took 253.93 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,821 INFO L168 Benchmark]: BuchiAutomizer took 8288.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:48,821 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:56:48,824 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 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 72.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.93 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8288.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 9 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 108 SDslu, 107 SDs, 0 SdLazy, 76 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital390 mio100 ax100 hnf99 lsp87 ukn107 mio100 lsp49 div142 bol100 ite100 ukn100 eq178 hnf75 smp85 dnf176 smp78 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...