./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:31,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:31,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:31,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:31,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:31,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:31,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:31,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:31,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:31,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:31,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:31,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:31,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:31,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:31,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:31,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:31,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:31,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:31,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:31,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:31,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:31,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:31,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:31,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:31,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:31,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:31,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:31,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:31,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:31,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:31,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:31,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:31,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:31,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:31,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:31,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:31,203 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:31,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:31,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:31,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:31,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:31,229 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:31,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:31,229 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:31,229 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:31,230 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:31,230 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:31,230 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:31,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:31,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:31,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:31,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:31,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:31,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:31,232 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:31,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:31,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:31,233 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:31,235 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:31,235 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_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2018-10-27 06:08:31,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:31,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:31,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:31,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:31,288 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:31,289 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-10-27 06:08:31,339 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/data/9390a7e1d/8286b133164e4a55addc4b5a53fb8760/FLAG75477af81 [2018-10-27 06:08:31,776 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:31,776 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-10-27 06:08:31,786 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/data/9390a7e1d/8286b133164e4a55addc4b5a53fb8760/FLAG75477af81 [2018-10-27 06:08:31,800 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/data/9390a7e1d/8286b133164e4a55addc4b5a53fb8760 [2018-10-27 06:08:31,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:31,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:31,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:31,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:31,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:31,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:31" (1/1) ... [2018-10-27 06:08:31,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4984b912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:31, skipping insertion in model container [2018-10-27 06:08:31,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:31" (1/1) ... [2018-10-27 06:08:31,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:31,861 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:32,127 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:32,137 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:32,178 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:32,218 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:32,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32 WrapperNode [2018-10-27 06:08:32,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:32,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:32,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:32,220 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:32,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:32,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:32,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:32,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:32,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... [2018-10-27 06:08:32,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:32,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:32,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:32,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:32,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e476beb-356e-4a83-a979-0b77d80ae583/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:32,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:33,075 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:33,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:33 BoogieIcfgContainer [2018-10-27 06:08:33,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:33,076 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:33,076 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:33,080 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:33,080 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:33,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:31" (1/3) ... [2018-10-27 06:08:33,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baa35b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:33, skipping insertion in model container [2018-10-27 06:08:33,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:33,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:32" (2/3) ... [2018-10-27 06:08:33,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baa35b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:33, skipping insertion in model container [2018-10-27 06:08:33,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:33,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:33" (3/3) ... [2018-10-27 06:08:33,085 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-10-27 06:08:33,139 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:33,140 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:33,140 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:33,140 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:33,140 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:33,140 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:33,140 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:33,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:33,141 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:33,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:08:33,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:33,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:33,184 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:33,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:08:33,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:33,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:33,193 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 13#L528true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 10#L530true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 12#L530-1true assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 15#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-5true [2018-10-27 06:08:33,194 INFO L795 eck$LassoCheckResult]: Loop: 7#L517-5true assume true; 3#L517-1true SUMMARY for call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L517-1 4#L517-2true assume !!(strlen_#t~mem8 != 0);havoc strlen_#t~mem8;strlen_#t~pre7 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre7; 6#L517-4true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-5true [2018-10-27 06:08:33,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,203 INFO L82 PathProgramCache]: Analyzing trace with hash 889567241, now seen corresponding path program 1 times [2018-10-27 06:08:33,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1478788, now seen corresponding path program 1 times [2018-10-27 06:08:33,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1274086540, now seen corresponding path program 1 times [2018-10-27 06:08:33,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:34,085 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-10-27 06:08:34,304 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 06:08:34,315 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:34,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:34,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:34,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:34,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:34,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:34,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:34,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:34,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:08:34,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:34,318 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:34,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,894 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-10-27 06:08:35,023 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 06:08:35,516 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:35,522 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:35,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,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-10-27 06:08:35,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,704 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:35,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:35,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:35,900 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:35,900 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:35,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:35,905 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:35,909 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:35,911 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-10-27 06:08:35,992 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:08:36,000 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:36,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,151 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:36,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-10-27 06:08:36,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 8 states. [2018-10-27 06:08:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-10-27 06:08:36,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2018-10-27 06:08:36,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 10 letters. Loop has 4 letters. [2018-10-27 06:08:36,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 8 letters. [2018-10-27 06:08:36,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:36,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2018-10-27 06:08:36,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-10-27 06:08:36,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 30 states and 33 transitions. [2018-10-27 06:08:36,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:36,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:08:36,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-10-27 06:08:36,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:36,218 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-27 06:08:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-10-27 06:08:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-10-27 06:08:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:08:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-10-27 06:08:36,240 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-27 06:08:36,240 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-27 06:08:36,240 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:36,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-10-27 06:08:36,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:08:36,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:36,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:36,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,242 INFO L793 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L528 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 179#L530 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 180#L530-1 assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 160#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 161#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := strdup_#t~ret9 + 1;havoc strdup_#t~ret9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := strdup_~l~0;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];strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 173#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 168#L511-7 [2018-10-27 06:08:36,243 INFO L795 eck$LassoCheckResult]: Loop: 168#L511-7 assume true; 171#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 176#L511-2 assume !!(memcpy_#t~post2 % 4294967296 != 0);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, memcpy_#t~post3.offset + 1;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, memcpy_#t~post4.offset + 1; 178#L511-4 SUMMARY for call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1); srcloc: L511-4 181#L511-5 SUMMARY for call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1); srcloc: L511-5 167#L511-6 havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset; 168#L511-7 [2018-10-27 06:08:36,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 175625804, now seen corresponding path program 1 times [2018-10-27 06:08:36,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:36,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:36,378 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:36,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488933, now seen corresponding path program 1 times [2018-10-27 06:08:36,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,516 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 06:08:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:36,555 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:08:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:36,582 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-10-27 06:08:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:36,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-10-27 06:08:36,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:08:36,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2018-10-27 06:08:36,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:08:36,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:08:36,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-10-27 06:08:36,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:36,585 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-27 06:08:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-10-27 06:08:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 06:08:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:08:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-27 06:08:36,587 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-27 06:08:36,587 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-27 06:08:36,587 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:36,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-10-27 06:08:36,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:08:36,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:36,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:36,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,589 INFO L793 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 228#L528 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 232#L530 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L530 233#L530-1 assume { :begin_inline_strdup } true;strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 213#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 214#L517-5 assume true; 215#L517-1 SUMMARY for call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L517-1 216#L517-2 assume !(strlen_#t~mem8 != 0);havoc strlen_#t~mem8; 221#L517-6 strlen_#res := strlen_~i~0; 226#L518 strdup_#t~ret9 := strlen_#res;assume { :end_inline_strlen } true;strdup_~l~0 := strdup_#t~ret9 + 1;havoc strdup_#t~ret9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := strdup_~l~0;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];strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 225#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);assume { :begin_inline_memcpy } true;memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 220#L511-7 [2018-10-27 06:08:36,589 INFO L795 eck$LassoCheckResult]: Loop: 220#L511-7 assume true; 223#L511-1 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 229#L511-2 assume !!(memcpy_#t~post2 % 4294967296 != 0);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, memcpy_#t~post3.offset + 1;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, memcpy_#t~post4.offset + 1; 231#L511-4 SUMMARY for call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1); srcloc: L511-4 234#L511-5 SUMMARY for call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1); srcloc: L511-5 219#L511-6 havoc memcpy_#t~mem5;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset; 220#L511-7 [2018-10-27 06:08:36,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash 331430871, now seen corresponding path program 1 times [2018-10-27 06:08:36,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488933, now seen corresponding path program 2 times [2018-10-27 06:08:36,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1148187323, now seen corresponding path program 1 times [2018-10-27 06:08:36,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:37,270 WARN L179 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 138 [2018-10-27 06:08:37,401 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-10-27 06:08:37,403 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:37,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:37,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:37,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:37,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:37,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:37,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:37,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:37,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:08:37,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:37,404 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:37,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,090 WARN L179 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2018-10-27 06:08:38,338 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-10-27 06:08:38,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,654 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:08:38,830 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-27 06:08:39,169 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:08:39,258 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:39,258 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:39,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,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-10-27 06:08:39,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:39,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,407 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:39,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,432 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:39,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,433 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:39,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:39,629 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:39,631 INFO L444 ModelExtractionUtils]: 83 out of 88 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:39,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:39,633 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:39,634 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:39,634 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcpy_~c1~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_memcpy_~c1~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-10-27 06:08:40,001 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-10-27 06:08:40,003 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:08:40,003 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:40,003 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:08:40,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:40,201 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:08:40,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-10-27 06:08:40,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 32 transitions. Complement of second has 7 states. [2018-10-27 06:08:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:08:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-10-27 06:08:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2018-10-27 06:08:40,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 6 letters. [2018-10-27 06:08:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 12 letters. [2018-10-27 06:08:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:40,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2018-10-27 06:08:40,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:40,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:40,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:40,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:40,301 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:40,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:40,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:40,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:40,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:40 BoogieIcfgContainer [2018-10-27 06:08:40,308 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:40,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:40,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:40,308 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:40,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:33" (3/4) ... [2018-10-27 06:08:40,316 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:40,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:40,317 INFO L168 Benchmark]: Toolchain (without parser) took 8512.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 956.5 MB in the beginning and 992.5 MB in the end (delta: -36.1 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:40,318 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:40,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:40,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -208.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:40,319 INFO L168 Benchmark]: Boogie Preprocessor took 44.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:40,319 INFO L168 Benchmark]: RCFGBuilder took 687.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:40,320 INFO L168 Benchmark]: BuchiAutomizer took 7231.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 127.4 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:40,320 INFO L168 Benchmark]: Witness Printer took 8.00 ms. Allocated memory is still 1.2 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:40,328 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 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 123.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -208.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 687.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7231.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 127.4 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.00 ms. Allocated memory is still 1.2 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * c1 + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 74 SDslu, 24 SDs, 0 SdLazy, 23 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp93 ukn113 mio100 lsp44 div113 bol100 ite100 ukn100 eq196 hnf83 smp98 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 9 VariablesLoop: 5 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...